/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/loops-crafted-1/in-de62.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:15:05,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:15:05,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:15:05,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:15:05,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:15:05,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:15:05,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:15:05,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:15:05,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:15:05,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:15:05,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:15:05,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:15:05,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:15:05,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:15:05,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:15:05,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:15:05,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:15:05,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:15:05,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:15:05,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:15:05,190 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:15:05,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:15:05,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:15:05,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:15:05,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:15:05,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:15:05,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:15:05,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:15:05,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:15:05,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:15:05,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:15:05,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:15:05,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:15:05,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:15:05,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:15:05,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:15:05,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:15:05,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:15:05,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:15:05,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:15:05,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:15:05,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:15:05,206 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:15:05,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:15:05,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:15:05,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:15:05,230 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:15:05,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:15:05,231 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:15:05,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:15:05,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:15:05,231 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:15:05,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:15:05,232 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:15:05,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:15:05,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:15:05,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:15:05,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:15:05,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:15:05,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:15:05,233 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:15:05,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:15:05,233 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:15:05,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:15:05,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:15:05,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:15:05,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:15:05,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:15:05,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:15:05,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:15:05,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:15:05,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:15:05,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:15:05,234 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:15:05,234 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:15:05,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:15:05,234 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:15:05,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:15:05,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:15:05,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:15:05,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:15:05,417 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:15:05,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-04-27 11:15:05,458 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303263e2b/f5970f8d537442e69dba7adabd8c34d5/FLAGcfd03f7de [2022-04-27 11:15:05,808 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:15:05,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-04-27 11:15:05,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303263e2b/f5970f8d537442e69dba7adabd8c34d5/FLAGcfd03f7de [2022-04-27 11:15:05,825 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303263e2b/f5970f8d537442e69dba7adabd8c34d5 [2022-04-27 11:15:05,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:15:05,828 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:15:05,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:15:05,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:15:05,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:15:05,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:15:05" (1/1) ... [2022-04-27 11:15:05,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17341fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:05, skipping insertion in model container [2022-04-27 11:15:05,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:15:05" (1/1) ... [2022-04-27 11:15:05,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:15:05,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:15:05,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c[368,381] [2022-04-27 11:15:06,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:15:06,008 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:15:06,018 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c[368,381] [2022-04-27 11:15:06,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:15:06,041 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:15:06,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:06 WrapperNode [2022-04-27 11:15:06,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:15:06,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:15:06,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:15:06,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:15:06,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:06" (1/1) ... [2022-04-27 11:15:06,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:06" (1/1) ... [2022-04-27 11:15:06,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:06" (1/1) ... [2022-04-27 11:15:06,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:06" (1/1) ... [2022-04-27 11:15:06,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:06" (1/1) ... [2022-04-27 11:15:06,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:06" (1/1) ... [2022-04-27 11:15:06,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:06" (1/1) ... [2022-04-27 11:15:06,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:15:06,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:15:06,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:15:06,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:15:06,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:06" (1/1) ... [2022-04-27 11:15:06,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:15:06,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:06,098 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:15:06,117 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:15:06,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:15:06,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:15:06,131 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:15:06,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:15:06,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:15:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:15:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:15:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:15:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:15:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 11:15:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:15:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:15:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:15:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:15:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:15:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:15:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:15:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:15:06,182 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:15:06,183 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:15:06,330 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:15:06,334 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:15:06,335 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-27 11:15:06,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:15:06 BoogieIcfgContainer [2022-04-27 11:15:06,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:15:06,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:15:06,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:15:06,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:15:06,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:15:05" (1/3) ... [2022-04-27 11:15:06,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5568fe33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:15:06, skipping insertion in model container [2022-04-27 11:15:06,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:15:06" (2/3) ... [2022-04-27 11:15:06,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5568fe33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:15:06, skipping insertion in model container [2022-04-27 11:15:06,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:15:06" (3/3) ... [2022-04-27 11:15:06,370 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de62.c [2022-04-27 11:15:06,378 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:15:06,378 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:15:06,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:15:06,453 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@48ff2ecb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3eeac493 [2022-04-27 11:15:06,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:15:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:15:06,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:15:06,465 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:06,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:06,466 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:06,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:06,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 1 times [2022-04-27 11:15:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:06,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229104567] [2022-04-27 11:15:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:06,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:06,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:06,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-27 11:15:06,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 11:15:06,648 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-27 11:15:06,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:06,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-27 11:15:06,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 11:15:06,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-27 11:15:06,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret17 := main(); {28#true} is VALID [2022-04-27 11:15:06,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28#true} is VALID [2022-04-27 11:15:06,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !(~x~0 % 4294967296 > 0); {28#true} is VALID [2022-04-27 11:15:06,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} ~z~0 := ~y~0; {28#true} is VALID [2022-04-27 11:15:06,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} assume !(~z~0 % 4294967296 > 0); {28#true} is VALID [2022-04-27 11:15:06,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume !(~y~0 % 4294967296 > 0); {28#true} is VALID [2022-04-27 11:15:06,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-27 11:15:06,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !(~z~0 % 4294967296 > 0); {29#false} is VALID [2022-04-27 11:15:06,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !(~y~0 % 4294967296 > 0); {29#false} is VALID [2022-04-27 11:15:06,652 INFO L272 TraceCheckUtils]: 13: Hoare triple {29#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {29#false} is VALID [2022-04-27 11:15:06,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-27 11:15:06,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-27 11:15:06,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-27 11:15:06,653 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:15:06,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:06,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229104567] [2022-04-27 11:15:06,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229104567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:15:06,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:15:06,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:15:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429338440] [2022-04-27 11:15:06,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:15:06,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:15:06,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:06,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:06,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:06,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:15:06,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:06,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:15:06,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:15:06,708 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:06,788 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-04-27 11:15:06,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:15:06,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:15:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-27 11:15:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-27 11:15:06,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-27 11:15:06,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:06,880 INFO L225 Difference]: With dead ends: 43 [2022-04-27 11:15:06,880 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 11:15:06,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:15:06,884 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:06,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:15:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 11:15:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 11:15:06,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:06,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:06,908 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:06,908 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:06,912 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-27 11:15:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-27 11:15:06,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:06,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:06,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 11:15:06,913 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 11:15:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:06,920 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-27 11:15:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-27 11:15:06,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:06,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:06,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:06,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-04-27 11:15:06,925 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-04-27 11:15:06,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:06,928 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-04-27 11:15:06,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-27 11:15:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:15:06,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:06,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:06,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:15:06,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:06,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 1 times [2022-04-27 11:15:06,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:06,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517563115] [2022-04-27 11:15:06,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:06,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:07,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {160#(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(10, 2);call #Ultimate.allocInit(12, 3); {152#true} is VALID [2022-04-27 11:15:07,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} assume true; {152#true} is VALID [2022-04-27 11:15:07,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {152#true} {152#true} #94#return; {152#true} is VALID [2022-04-27 11:15:07,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:07,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#(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(10, 2);call #Ultimate.allocInit(12, 3); {152#true} is VALID [2022-04-27 11:15:07,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2022-04-27 11:15:07,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #94#return; {152#true} is VALID [2022-04-27 11:15:07,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret17 := main(); {152#true} is VALID [2022-04-27 11:15:07,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {152#true} is VALID [2022-04-27 11:15:07,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#true} assume !(~x~0 % 4294967296 > 0); {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-27 11:15:07,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} ~z~0 := ~y~0; {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-27 11:15:07,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-27 11:15:07,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-27 11:15:07,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~x~0 % 4294967296 > 0); {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-27 11:15:07,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-27 11:15:07,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-27 11:15:07,018 INFO L272 TraceCheckUtils]: 13: Hoare triple {157#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {158#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:15:07,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {158#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {159#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:15:07,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {159#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {153#false} is VALID [2022-04-27 11:15:07,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-04-27 11:15:07,019 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:15:07,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:07,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517563115] [2022-04-27 11:15:07,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517563115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:15:07,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:15:07,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:15:07,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837249086] [2022-04-27 11:15:07,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:15:07,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:15:07,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:07,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:07,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:15:07,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:07,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:15:07,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:15:07,035 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,217 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-27 11:15:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:15:07,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:15:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-27 11:15:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-27 11:15:07,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-27 11:15:07,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:07,263 INFO L225 Difference]: With dead ends: 34 [2022-04-27 11:15:07,263 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 11:15:07,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:15:07,268 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:07,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:15:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 11:15:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 11:15:07,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:07,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,281 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,282 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,283 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-27 11:15:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-27 11:15:07,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:07,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:07,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 11:15:07,284 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 11:15:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,286 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-27 11:15:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-27 11:15:07,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:07,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:07,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:07,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-04-27 11:15:07,289 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 17 [2022-04-27 11:15:07,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:07,290 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-04-27 11:15:07,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-27 11:15:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 11:15:07,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:07,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:07,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:15:07,292 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:07,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:07,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1181238037, now seen corresponding path program 1 times [2022-04-27 11:15:07,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:07,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495937401] [2022-04-27 11:15:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:07,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:07,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {300#(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(10, 2);call #Ultimate.allocInit(12, 3); {294#true} is VALID [2022-04-27 11:15:07,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 11:15:07,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {294#true} {294#true} #94#return; {294#true} is VALID [2022-04-27 11:15:07,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:07,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {300#(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(10, 2);call #Ultimate.allocInit(12, 3); {294#true} is VALID [2022-04-27 11:15:07,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 11:15:07,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #94#return; {294#true} is VALID [2022-04-27 11:15:07,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret17 := main(); {294#true} is VALID [2022-04-27 11:15:07,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {294#true} is VALID [2022-04-27 11:15:07,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#true} assume !(~x~0 % 4294967296 > 0); {294#true} is VALID [2022-04-27 11:15:07,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#true} ~z~0 := ~y~0; {294#true} is VALID [2022-04-27 11:15:07,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#true} assume !(~z~0 % 4294967296 > 0); {294#true} is VALID [2022-04-27 11:15:07,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#true} assume !(~y~0 % 4294967296 > 0); {299#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-27 11:15:07,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {299#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {299#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-27 11:15:07,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {299#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {299#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-27 11:15:07,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {299#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {295#false} is VALID [2022-04-27 11:15:07,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#false} assume !(~y~0 % 4294967296 > 0); {295#false} is VALID [2022-04-27 11:15:07,385 INFO L272 TraceCheckUtils]: 14: Hoare triple {295#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {295#false} is VALID [2022-04-27 11:15:07,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {295#false} ~cond := #in~cond; {295#false} is VALID [2022-04-27 11:15:07,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {295#false} assume 0 == ~cond; {295#false} is VALID [2022-04-27 11:15:07,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-27 11:15:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:07,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:07,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495937401] [2022-04-27 11:15:07,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495937401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:15:07,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:15:07,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:15:07,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308335133] [2022-04-27 11:15:07,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:15:07,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 11:15:07,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:07,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:07,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:15:07,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:15:07,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:15:07,400 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,495 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2022-04-27 11:15:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:15:07,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 11:15:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-27 11:15:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-27 11:15:07,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-04-27 11:15:07,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:07,535 INFO L225 Difference]: With dead ends: 47 [2022-04-27 11:15:07,535 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 11:15:07,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:15:07,536 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:07,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 25 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:15:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 11:15:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 11:15:07,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:07,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,543 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,543 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,545 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-04-27 11:15:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-27 11:15:07,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:07,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:07,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 11:15:07,546 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 11:15:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,547 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-04-27 11:15:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-27 11:15:07,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:07,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:07,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:07,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2022-04-27 11:15:07,549 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 18 [2022-04-27 11:15:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:07,549 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-04-27 11:15:07,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-27 11:15:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 11:15:07,550 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:07,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:07,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:15:07,551 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:07,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:07,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1710900860, now seen corresponding path program 1 times [2022-04-27 11:15:07,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:07,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179210099] [2022-04-27 11:15:07,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:07,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:07,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:07,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {484#(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(10, 2);call #Ultimate.allocInit(12, 3); {478#true} is VALID [2022-04-27 11:15:07,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} assume true; {478#true} is VALID [2022-04-27 11:15:07,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {478#true} {478#true} #94#return; {478#true} is VALID [2022-04-27 11:15:07,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:07,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#(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(10, 2);call #Ultimate.allocInit(12, 3); {478#true} is VALID [2022-04-27 11:15:07,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#true} assume true; {478#true} is VALID [2022-04-27 11:15:07,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478#true} {478#true} #94#return; {478#true} is VALID [2022-04-27 11:15:07,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {478#true} call #t~ret17 := main(); {478#true} is VALID [2022-04-27 11:15:07,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {478#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {478#true} is VALID [2022-04-27 11:15:07,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {478#true} assume !(~x~0 % 4294967296 > 0); {478#true} is VALID [2022-04-27 11:15:07,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {478#true} ~z~0 := ~y~0; {478#true} is VALID [2022-04-27 11:15:07,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {478#true} assume !(~z~0 % 4294967296 > 0); {483#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-27 11:15:07,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {483#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {483#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-27 11:15:07,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {483#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {483#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-27 11:15:07,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {483#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {479#false} is VALID [2022-04-27 11:15:07,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {479#false} assume !(~z~0 % 4294967296 > 0); {479#false} is VALID [2022-04-27 11:15:07,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {479#false} assume !(~y~0 % 4294967296 > 0); {479#false} is VALID [2022-04-27 11:15:07,588 INFO L272 TraceCheckUtils]: 14: Hoare triple {479#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {479#false} is VALID [2022-04-27 11:15:07,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {479#false} ~cond := #in~cond; {479#false} is VALID [2022-04-27 11:15:07,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {479#false} assume 0 == ~cond; {479#false} is VALID [2022-04-27 11:15:07,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {479#false} assume !false; {479#false} is VALID [2022-04-27 11:15:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:07,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:07,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179210099] [2022-04-27 11:15:07,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179210099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:15:07,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:15:07,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:15:07,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046356726] [2022-04-27 11:15:07,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:15:07,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 11:15:07,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:07,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:07,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:15:07,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:07,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:15:07,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:15:07,603 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,690 INFO L93 Difference]: Finished difference Result 49 states and 69 transitions. [2022-04-27 11:15:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:15:07,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 11:15:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-27 11:15:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-27 11:15:07,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-27 11:15:07,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:07,732 INFO L225 Difference]: With dead ends: 49 [2022-04-27 11:15:07,732 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 11:15:07,732 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:15:07,733 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:07,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:15:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 11:15:07,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 11:15:07,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:07,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,740 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,740 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,741 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-04-27 11:15:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-27 11:15:07,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:07,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:07,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-27 11:15:07,742 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-27 11:15:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,743 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-04-27 11:15:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-27 11:15:07,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:07,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:07,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:07,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-27 11:15:07,745 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 18 [2022-04-27 11:15:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:07,745 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2022-04-27 11:15:07,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-27 11:15:07,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:15:07,746 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:07,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:07,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 11:15:07,746 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:07,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:07,746 INFO L85 PathProgramCache]: Analyzing trace with hash 375506293, now seen corresponding path program 1 times [2022-04-27 11:15:07,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:07,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545742378] [2022-04-27 11:15:07,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:07,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:07,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:07,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {682#(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(10, 2);call #Ultimate.allocInit(12, 3); {675#true} is VALID [2022-04-27 11:15:07,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume true; {675#true} is VALID [2022-04-27 11:15:07,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {675#true} {675#true} #94#return; {675#true} is VALID [2022-04-27 11:15:07,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {675#true} call ULTIMATE.init(); {682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:07,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#(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(10, 2);call #Ultimate.allocInit(12, 3); {675#true} is VALID [2022-04-27 11:15:07,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} assume true; {675#true} is VALID [2022-04-27 11:15:07,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {675#true} {675#true} #94#return; {675#true} is VALID [2022-04-27 11:15:07,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {675#true} call #t~ret17 := main(); {675#true} is VALID [2022-04-27 11:15:07,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {680#(= main_~y~0 0)} is VALID [2022-04-27 11:15:07,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {680#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {680#(= main_~y~0 0)} is VALID [2022-04-27 11:15:07,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {680#(= main_~y~0 0)} ~z~0 := ~y~0; {681#(= main_~z~0 0)} is VALID [2022-04-27 11:15:07,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {681#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {676#false} is VALID [2022-04-27 11:15:07,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {676#false} assume !(~z~0 % 4294967296 > 0); {676#false} is VALID [2022-04-27 11:15:07,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {676#false} assume !(~y~0 % 4294967296 > 0); {676#false} is VALID [2022-04-27 11:15:07,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {676#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {676#false} is VALID [2022-04-27 11:15:07,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {676#false} assume !(~x~0 % 4294967296 > 0); {676#false} is VALID [2022-04-27 11:15:07,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {676#false} assume !(~z~0 % 4294967296 > 0); {676#false} is VALID [2022-04-27 11:15:07,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {676#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {676#false} is VALID [2022-04-27 11:15:07,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#false} assume !(~y~0 % 4294967296 > 0); {676#false} is VALID [2022-04-27 11:15:07,791 INFO L272 TraceCheckUtils]: 16: Hoare triple {676#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {676#false} is VALID [2022-04-27 11:15:07,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {676#false} ~cond := #in~cond; {676#false} is VALID [2022-04-27 11:15:07,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {676#false} assume 0 == ~cond; {676#false} is VALID [2022-04-27 11:15:07,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {676#false} assume !false; {676#false} is VALID [2022-04-27 11:15:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:07,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:07,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545742378] [2022-04-27 11:15:07,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545742378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:15:07,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:15:07,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:15:07,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577406192] [2022-04-27 11:15:07,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:15:07,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:15:07,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:07,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,805 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:15:07,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:15:07,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:07,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:15:07,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:15:07,806 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,893 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 11:15:07,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:15:07,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:15:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-27 11:15:07,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-27 11:15:07,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-27 11:15:07,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:07,935 INFO L225 Difference]: With dead ends: 47 [2022-04-27 11:15:07,935 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 11:15:07,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:15:07,940 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:07,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 33 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:15:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 11:15:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 11:15:07,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:07,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,948 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,948 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,949 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-27 11:15:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-27 11:15:07,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:07,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:07,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 11:15:07,950 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 11:15:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,951 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-27 11:15:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-27 11:15:07,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:07,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:07,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:07,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2022-04-27 11:15:07,953 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 20 [2022-04-27 11:15:07,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:07,953 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2022-04-27 11:15:07,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-27 11:15:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:15:07,953 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:07,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:07,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 11:15:07,954 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:07,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1300031754, now seen corresponding path program 1 times [2022-04-27 11:15:07,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:07,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868428618] [2022-04-27 11:15:07,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:07,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:08,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:08,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {867#(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(10, 2);call #Ultimate.allocInit(12, 3); {859#true} is VALID [2022-04-27 11:15:08,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {859#true} assume true; {859#true} is VALID [2022-04-27 11:15:08,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {859#true} {859#true} #94#return; {859#true} is VALID [2022-04-27 11:15:08,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {859#true} call ULTIMATE.init(); {867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:08,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {867#(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(10, 2);call #Ultimate.allocInit(12, 3); {859#true} is VALID [2022-04-27 11:15:08,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {859#true} assume true; {859#true} is VALID [2022-04-27 11:15:08,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {859#true} {859#true} #94#return; {859#true} is VALID [2022-04-27 11:15:08,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {859#true} call #t~ret17 := main(); {859#true} is VALID [2022-04-27 11:15:08,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {859#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {864#(= main_~y~0 0)} is VALID [2022-04-27 11:15:08,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {864#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {865#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:08,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {865#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {865#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:08,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {865#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {866#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:08,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {860#false} is VALID [2022-04-27 11:15:08,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#false} assume !(~y~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#false} assume !(~x~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {860#false} is VALID [2022-04-27 11:15:08,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#false} assume !(~z~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#false} assume !(~y~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,047 INFO L272 TraceCheckUtils]: 16: Hoare triple {860#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {860#false} is VALID [2022-04-27 11:15:08,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {860#false} ~cond := #in~cond; {860#false} is VALID [2022-04-27 11:15:08,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#false} assume 0 == ~cond; {860#false} is VALID [2022-04-27 11:15:08,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {860#false} assume !false; {860#false} is VALID [2022-04-27 11:15:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:08,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:08,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868428618] [2022-04-27 11:15:08,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868428618] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:08,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559154827] [2022-04-27 11:15:08,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:08,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:08,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:08,052 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:15:08,088 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:15:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:08,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:15:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:08,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:08,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {859#true} call ULTIMATE.init(); {859#true} is VALID [2022-04-27 11:15:08,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {859#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(10, 2);call #Ultimate.allocInit(12, 3); {859#true} is VALID [2022-04-27 11:15:08,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {859#true} assume true; {859#true} is VALID [2022-04-27 11:15:08,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {859#true} {859#true} #94#return; {859#true} is VALID [2022-04-27 11:15:08,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {859#true} call #t~ret17 := main(); {859#true} is VALID [2022-04-27 11:15:08,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {859#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {864#(= main_~y~0 0)} is VALID [2022-04-27 11:15:08,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {864#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {865#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:08,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {865#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {865#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:08,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {865#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {895#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:08,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {860#false} is VALID [2022-04-27 11:15:08,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#false} assume !(~y~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#false} assume !(~x~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {860#false} is VALID [2022-04-27 11:15:08,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#false} assume !(~z~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#false} assume !(~y~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,242 INFO L272 TraceCheckUtils]: 16: Hoare triple {860#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {860#false} is VALID [2022-04-27 11:15:08,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {860#false} ~cond := #in~cond; {860#false} is VALID [2022-04-27 11:15:08,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#false} assume 0 == ~cond; {860#false} is VALID [2022-04-27 11:15:08,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {860#false} assume !false; {860#false} is VALID [2022-04-27 11:15:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:08,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:08,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {860#false} assume !false; {860#false} is VALID [2022-04-27 11:15:08,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#false} assume 0 == ~cond; {860#false} is VALID [2022-04-27 11:15:08,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {860#false} ~cond := #in~cond; {860#false} is VALID [2022-04-27 11:15:08,333 INFO L272 TraceCheckUtils]: 16: Hoare triple {860#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {860#false} is VALID [2022-04-27 11:15:08,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#false} assume !(~y~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#false} assume !(~z~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {860#false} is VALID [2022-04-27 11:15:08,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#false} assume !(~x~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#false} assume !(~y~0 % 4294967296 > 0); {860#false} is VALID [2022-04-27 11:15:08,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {956#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {860#false} is VALID [2022-04-27 11:15:08,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {960#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {956#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:15:08,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {859#true} ~z~0 := ~y~0; {960#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:15:08,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {859#true} assume !(~x~0 % 4294967296 > 0); {859#true} is VALID [2022-04-27 11:15:08,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {859#true} is VALID [2022-04-27 11:15:08,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {859#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {859#true} is VALID [2022-04-27 11:15:08,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {859#true} call #t~ret17 := main(); {859#true} is VALID [2022-04-27 11:15:08,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {859#true} {859#true} #94#return; {859#true} is VALID [2022-04-27 11:15:08,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {859#true} assume true; {859#true} is VALID [2022-04-27 11:15:08,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {859#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(10, 2);call #Ultimate.allocInit(12, 3); {859#true} is VALID [2022-04-27 11:15:08,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {859#true} call ULTIMATE.init(); {859#true} is VALID [2022-04-27 11:15:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:08,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559154827] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:08,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:15:08,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 9 [2022-04-27 11:15:08,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351424887] [2022-04-27 11:15:08,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:15:08,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:15:08,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:08,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:08,347 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:15:08,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:15:08,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:08,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:15:08,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:15:08,348 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:08,396 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-27 11:15:08,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:15:08,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:15:08,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-27 11:15:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-27 11:15:08,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-27 11:15:08,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:08,423 INFO L225 Difference]: With dead ends: 41 [2022-04-27 11:15:08,423 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 11:15:08,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:15:08,424 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:08,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 46 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:15:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 11:15:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 11:15:08,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:08,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:08,430 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:08,430 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:08,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:08,431 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-04-27 11:15:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-27 11:15:08,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:08,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:08,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-27 11:15:08,432 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-27 11:15:08,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:08,433 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-04-27 11:15:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-27 11:15:08,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:08,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:08,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:08,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-04-27 11:15:08,434 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2022-04-27 11:15:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:08,434 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-04-27 11:15:08,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-27 11:15:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 11:15:08,435 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:08,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:08,453 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:15:08,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-27 11:15:08,648 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:08,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:08,648 INFO L85 PathProgramCache]: Analyzing trace with hash 30273528, now seen corresponding path program 1 times [2022-04-27 11:15:08,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:08,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487748664] [2022-04-27 11:15:08,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:08,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:08,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:08,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {1150#(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(10, 2);call #Ultimate.allocInit(12, 3); {1143#true} is VALID [2022-04-27 11:15:08,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {1143#true} assume true; {1143#true} is VALID [2022-04-27 11:15:08,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1143#true} {1143#true} #94#return; {1143#true} is VALID [2022-04-27 11:15:08,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {1143#true} call ULTIMATE.init(); {1150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:08,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {1150#(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(10, 2);call #Ultimate.allocInit(12, 3); {1143#true} is VALID [2022-04-27 11:15:08,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {1143#true} assume true; {1143#true} is VALID [2022-04-27 11:15:08,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1143#true} {1143#true} #94#return; {1143#true} is VALID [2022-04-27 11:15:08,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {1143#true} call #t~ret17 := main(); {1143#true} is VALID [2022-04-27 11:15:08,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {1143#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1148#(= main_~y~0 0)} is VALID [2022-04-27 11:15:08,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {1148#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1149#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:15:08,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {1149#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {1149#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:15:08,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {1149#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} ~z~0 := ~y~0; {1149#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:15:08,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {1149#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1149#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:15:08,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {1149#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1149#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:15:08,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {1149#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {1144#false} is VALID [2022-04-27 11:15:08,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {1144#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1144#false} is VALID [2022-04-27 11:15:08,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {1144#false} assume !(~x~0 % 4294967296 > 0); {1144#false} is VALID [2022-04-27 11:15:08,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {1144#false} assume !(~z~0 % 4294967296 > 0); {1144#false} is VALID [2022-04-27 11:15:08,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {1144#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {1144#false} is VALID [2022-04-27 11:15:08,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {1144#false} assume !(~y~0 % 4294967296 > 0); {1144#false} is VALID [2022-04-27 11:15:08,727 INFO L272 TraceCheckUtils]: 17: Hoare triple {1144#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1144#false} is VALID [2022-04-27 11:15:08,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {1144#false} ~cond := #in~cond; {1144#false} is VALID [2022-04-27 11:15:08,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {1144#false} assume 0 == ~cond; {1144#false} is VALID [2022-04-27 11:15:08,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {1144#false} assume !false; {1144#false} is VALID [2022-04-27 11:15:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:15:08,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:08,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487748664] [2022-04-27 11:15:08,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487748664] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:08,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832560767] [2022-04-27 11:15:08,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:08,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:08,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:08,729 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:15:08,747 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:15:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:08,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:15:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:08,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:08,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {1143#true} call ULTIMATE.init(); {1143#true} is VALID [2022-04-27 11:15:08,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {1143#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(10, 2);call #Ultimate.allocInit(12, 3); {1143#true} is VALID [2022-04-27 11:15:08,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {1143#true} assume true; {1143#true} is VALID [2022-04-27 11:15:08,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1143#true} {1143#true} #94#return; {1143#true} is VALID [2022-04-27 11:15:08,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {1143#true} call #t~ret17 := main(); {1143#true} is VALID [2022-04-27 11:15:08,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {1143#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1148#(= main_~y~0 0)} is VALID [2022-04-27 11:15:08,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {1148#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1172#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:15:08,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {1172#(= (+ (- 1) main_~y~0) 0)} assume !(~x~0 % 4294967296 > 0); {1172#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:15:08,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {1172#(= (+ (- 1) main_~y~0) 0)} ~z~0 := ~y~0; {1179#(and (= main_~z~0 main_~y~0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 11:15:08,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#(and (= main_~z~0 main_~y~0) (= (+ (- 1) main_~y~0) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1172#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:15:08,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {1172#(= (+ (- 1) main_~y~0) 0)} assume !(~z~0 % 4294967296 > 0); {1172#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:15:08,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {1172#(= (+ (- 1) main_~y~0) 0)} assume !(~y~0 % 4294967296 > 0); {1172#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:15:08,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {1172#(= (+ (- 1) main_~y~0) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1192#(= main_~y~0 2)} is VALID [2022-04-27 11:15:08,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {1192#(= main_~y~0 2)} assume !(~x~0 % 4294967296 > 0); {1192#(= main_~y~0 2)} is VALID [2022-04-27 11:15:08,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#(= main_~y~0 2)} assume !(~z~0 % 4294967296 > 0); {1192#(= main_~y~0 2)} is VALID [2022-04-27 11:15:08,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {1192#(= main_~y~0 2)} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {1172#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:15:08,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {1172#(= (+ (- 1) main_~y~0) 0)} assume !(~y~0 % 4294967296 > 0); {1144#false} is VALID [2022-04-27 11:15:08,875 INFO L272 TraceCheckUtils]: 17: Hoare triple {1144#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1144#false} is VALID [2022-04-27 11:15:08,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {1144#false} ~cond := #in~cond; {1144#false} is VALID [2022-04-27 11:15:08,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {1144#false} assume 0 == ~cond; {1144#false} is VALID [2022-04-27 11:15:08,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {1144#false} assume !false; {1144#false} is VALID [2022-04-27 11:15:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:08,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:08,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {1144#false} assume !false; {1144#false} is VALID [2022-04-27 11:15:08,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {1144#false} assume 0 == ~cond; {1144#false} is VALID [2022-04-27 11:15:08,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {1144#false} ~cond := #in~cond; {1144#false} is VALID [2022-04-27 11:15:08,980 INFO L272 TraceCheckUtils]: 17: Hoare triple {1144#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1144#false} is VALID [2022-04-27 11:15:08,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1144#false} is VALID [2022-04-27 11:15:08,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {1229#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:15:08,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1233#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:08,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1233#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:08,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1233#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:08,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {1229#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1229#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:15:08,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {1229#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1229#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:15:08,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {1252#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1229#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:15:08,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {1143#true} ~z~0 := ~y~0; {1252#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:15:08,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {1143#true} assume !(~x~0 % 4294967296 > 0); {1143#true} is VALID [2022-04-27 11:15:08,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {1143#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1143#true} is VALID [2022-04-27 11:15:08,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {1143#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1143#true} is VALID [2022-04-27 11:15:08,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {1143#true} call #t~ret17 := main(); {1143#true} is VALID [2022-04-27 11:15:08,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1143#true} {1143#true} #94#return; {1143#true} is VALID [2022-04-27 11:15:08,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {1143#true} assume true; {1143#true} is VALID [2022-04-27 11:15:08,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {1143#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(10, 2);call #Ultimate.allocInit(12, 3); {1143#true} is VALID [2022-04-27 11:15:08,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {1143#true} call ULTIMATE.init(); {1143#true} is VALID [2022-04-27 11:15:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:15:08,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832560767] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:08,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:08,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 11 [2022-04-27 11:15:08,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037907657] [2022-04-27 11:15:08,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:08,986 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:15:08,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:08,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:09,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:09,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:15:09,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:09,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:15:09,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:15:09,018 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:09,503 INFO L93 Difference]: Finished difference Result 100 states and 154 transitions. [2022-04-27 11:15:09,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 11:15:09,504 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:15:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 113 transitions. [2022-04-27 11:15:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 113 transitions. [2022-04-27 11:15:09,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 113 transitions. [2022-04-27 11:15:09,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:09,609 INFO L225 Difference]: With dead ends: 100 [2022-04-27 11:15:09,609 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 11:15:09,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2022-04-27 11:15:09,610 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 103 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:09,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 46 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:15:09,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 11:15:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2022-04-27 11:15:09,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:09,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 58 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:09,634 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 58 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:09,634 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 58 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:09,636 INFO L93 Difference]: Finished difference Result 82 states and 114 transitions. [2022-04-27 11:15:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2022-04-27 11:15:09,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:09,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:09,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-27 11:15:09,637 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-27 11:15:09,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:09,639 INFO L93 Difference]: Finished difference Result 82 states and 114 transitions. [2022-04-27 11:15:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2022-04-27 11:15:09,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:09,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:09,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:09,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2022-04-27 11:15:09,641 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 21 [2022-04-27 11:15:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:09,641 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2022-04-27 11:15:09,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2022-04-27 11:15:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 11:15:09,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:09,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:09,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 11:15:09,855 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,SelfDestructingSolverStorable6 [2022-04-27 11:15:09,855 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:09,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1232820840, now seen corresponding path program 1 times [2022-04-27 11:15:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:09,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353231387] [2022-04-27 11:15:09,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:09,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:09,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:09,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {1687#(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(10, 2);call #Ultimate.allocInit(12, 3); {1680#true} is VALID [2022-04-27 11:15:09,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {1680#true} assume true; {1680#true} is VALID [2022-04-27 11:15:09,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1680#true} {1680#true} #94#return; {1680#true} is VALID [2022-04-27 11:15:09,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {1680#true} call ULTIMATE.init(); {1687#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:09,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {1687#(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(10, 2);call #Ultimate.allocInit(12, 3); {1680#true} is VALID [2022-04-27 11:15:09,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {1680#true} assume true; {1680#true} is VALID [2022-04-27 11:15:09,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1680#true} {1680#true} #94#return; {1680#true} is VALID [2022-04-27 11:15:09,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {1680#true} call #t~ret17 := main(); {1680#true} is VALID [2022-04-27 11:15:09,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {1680#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1680#true} is VALID [2022-04-27 11:15:09,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {1680#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:09,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:09,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:09,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:15:09,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:15:09,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:15:09,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:15:09,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1681#false} is VALID [2022-04-27 11:15:09,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {1681#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1681#false} is VALID [2022-04-27 11:15:09,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {1681#false} assume !(~z~0 % 4294967296 > 0); {1681#false} is VALID [2022-04-27 11:15:09,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {1681#false} assume !(~y~0 % 4294967296 > 0); {1681#false} is VALID [2022-04-27 11:15:09,911 INFO L272 TraceCheckUtils]: 17: Hoare triple {1681#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1681#false} is VALID [2022-04-27 11:15:09,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {1681#false} ~cond := #in~cond; {1681#false} is VALID [2022-04-27 11:15:09,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {1681#false} assume 0 == ~cond; {1681#false} is VALID [2022-04-27 11:15:09,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {1681#false} assume !false; {1681#false} is VALID [2022-04-27 11:15:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:09,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:09,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353231387] [2022-04-27 11:15:09,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353231387] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:09,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933752204] [2022-04-27 11:15:09,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:09,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:09,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:09,913 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:15:09,914 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:15:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:09,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 11:15:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:09,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:10,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {1680#true} call ULTIMATE.init(); {1680#true} is VALID [2022-04-27 11:15:10,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {1680#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(10, 2);call #Ultimate.allocInit(12, 3); {1680#true} is VALID [2022-04-27 11:15:10,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {1680#true} assume true; {1680#true} is VALID [2022-04-27 11:15:10,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1680#true} {1680#true} #94#return; {1680#true} is VALID [2022-04-27 11:15:10,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {1680#true} call #t~ret17 := main(); {1680#true} is VALID [2022-04-27 11:15:10,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {1680#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1680#true} is VALID [2022-04-27 11:15:10,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {1680#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:10,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:10,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:10,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:15:10,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:15:10,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:15:10,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:15:10,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1681#false} is VALID [2022-04-27 11:15:10,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {1681#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1681#false} is VALID [2022-04-27 11:15:10,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {1681#false} assume !(~z~0 % 4294967296 > 0); {1681#false} is VALID [2022-04-27 11:15:10,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {1681#false} assume !(~y~0 % 4294967296 > 0); {1681#false} is VALID [2022-04-27 11:15:10,204 INFO L272 TraceCheckUtils]: 17: Hoare triple {1681#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1681#false} is VALID [2022-04-27 11:15:10,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {1681#false} ~cond := #in~cond; {1681#false} is VALID [2022-04-27 11:15:10,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {1681#false} assume 0 == ~cond; {1681#false} is VALID [2022-04-27 11:15:10,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {1681#false} assume !false; {1681#false} is VALID [2022-04-27 11:15:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:10,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:10,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {1681#false} assume !false; {1681#false} is VALID [2022-04-27 11:15:10,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {1681#false} assume 0 == ~cond; {1681#false} is VALID [2022-04-27 11:15:10,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {1681#false} ~cond := #in~cond; {1681#false} is VALID [2022-04-27 11:15:10,424 INFO L272 TraceCheckUtils]: 17: Hoare triple {1681#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1681#false} is VALID [2022-04-27 11:15:10,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {1681#false} assume !(~y~0 % 4294967296 > 0); {1681#false} is VALID [2022-04-27 11:15:10,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {1681#false} assume !(~z~0 % 4294967296 > 0); {1681#false} is VALID [2022-04-27 11:15:10,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {1681#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1681#false} is VALID [2022-04-27 11:15:10,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1681#false} is VALID [2022-04-27 11:15:10,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:15:10,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:15:10,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:15:10,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1686#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:15:10,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:10,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:10,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {1680#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1685#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:10,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {1680#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1680#true} is VALID [2022-04-27 11:15:10,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {1680#true} call #t~ret17 := main(); {1680#true} is VALID [2022-04-27 11:15:10,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1680#true} {1680#true} #94#return; {1680#true} is VALID [2022-04-27 11:15:10,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {1680#true} assume true; {1680#true} is VALID [2022-04-27 11:15:10,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {1680#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(10, 2);call #Ultimate.allocInit(12, 3); {1680#true} is VALID [2022-04-27 11:15:10,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {1680#true} call ULTIMATE.init(); {1680#true} is VALID [2022-04-27 11:15:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:10,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933752204] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:10,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:10,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-27 11:15:10,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342417912] [2022-04-27 11:15:10,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:10,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:15:10,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:10,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:10,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:10,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:15:10,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:10,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:15:10,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:15:10,447 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:10,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:10,606 INFO L93 Difference]: Finished difference Result 101 states and 146 transitions. [2022-04-27 11:15:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:15:10,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:15:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 11:15:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 11:15:10,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 11:15:10,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:10,643 INFO L225 Difference]: With dead ends: 101 [2022-04-27 11:15:10,643 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 11:15:10,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:15:10,644 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:10,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 34 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:15:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 11:15:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 70. [2022-04-27 11:15:10,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:10,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 70 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 65 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:10,679 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 70 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 65 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:10,679 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 70 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 65 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:10,681 INFO L93 Difference]: Finished difference Result 93 states and 136 transitions. [2022-04-27 11:15:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2022-04-27 11:15:10,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:10,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:10,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 65 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-27 11:15:10,681 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 65 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-27 11:15:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:10,683 INFO L93 Difference]: Finished difference Result 93 states and 136 transitions. [2022-04-27 11:15:10,683 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2022-04-27 11:15:10,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:10,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:10,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:10,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 65 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 101 transitions. [2022-04-27 11:15:10,686 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 101 transitions. Word has length 21 [2022-04-27 11:15:10,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:10,686 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 101 transitions. [2022-04-27 11:15:10,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:10,686 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2022-04-27 11:15:10,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:15:10,687 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:10,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:10,708 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:15:10,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:10,899 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash -29884763, now seen corresponding path program 1 times [2022-04-27 11:15:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:10,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398065786] [2022-04-27 11:15:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:10,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:11,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:11,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {2236#(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(10, 2);call #Ultimate.allocInit(12, 3); {2226#true} is VALID [2022-04-27 11:15:11,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {2226#true} assume true; {2226#true} is VALID [2022-04-27 11:15:11,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2226#true} {2226#true} #94#return; {2226#true} is VALID [2022-04-27 11:15:11,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {2226#true} call ULTIMATE.init(); {2236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:11,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {2236#(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(10, 2);call #Ultimate.allocInit(12, 3); {2226#true} is VALID [2022-04-27 11:15:11,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {2226#true} assume true; {2226#true} is VALID [2022-04-27 11:15:11,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2226#true} {2226#true} #94#return; {2226#true} is VALID [2022-04-27 11:15:11,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {2226#true} call #t~ret17 := main(); {2226#true} is VALID [2022-04-27 11:15:11,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {2226#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2231#(= main_~y~0 0)} is VALID [2022-04-27 11:15:11,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {2231#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:11,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {2232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:11,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {2232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {2233#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:11,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {2233#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2234#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:11,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {2234#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2234#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:11,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {2234#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2235#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:11,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {2235#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {2235#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:11,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {2235#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2235#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:11,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {2235#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {2235#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:11,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {2235#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2227#false} is VALID [2022-04-27 11:15:11,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {2227#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2227#false} is VALID [2022-04-27 11:15:11,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {2227#false} assume !(~y~0 % 4294967296 > 0); {2227#false} is VALID [2022-04-27 11:15:11,026 INFO L272 TraceCheckUtils]: 18: Hoare triple {2227#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2227#false} is VALID [2022-04-27 11:15:11,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {2227#false} ~cond := #in~cond; {2227#false} is VALID [2022-04-27 11:15:11,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {2227#false} assume 0 == ~cond; {2227#false} is VALID [2022-04-27 11:15:11,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {2227#false} assume !false; {2227#false} is VALID [2022-04-27 11:15:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:11,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:11,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398065786] [2022-04-27 11:15:11,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398065786] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:11,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224036281] [2022-04-27 11:15:11,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:11,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:11,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:11,028 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:15:11,029 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:15:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:11,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 11:15:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:11,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:11,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {2226#true} call ULTIMATE.init(); {2226#true} is VALID [2022-04-27 11:15:11,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {2226#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(10, 2);call #Ultimate.allocInit(12, 3); {2226#true} is VALID [2022-04-27 11:15:11,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {2226#true} assume true; {2226#true} is VALID [2022-04-27 11:15:11,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2226#true} {2226#true} #94#return; {2226#true} is VALID [2022-04-27 11:15:11,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {2226#true} call #t~ret17 := main(); {2226#true} is VALID [2022-04-27 11:15:11,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {2226#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2231#(= main_~y~0 0)} is VALID [2022-04-27 11:15:11,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {2231#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:11,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {2232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:11,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {2232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {2264#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:11,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {2264#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2268#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:11,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {2268#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {2268#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:11,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {2268#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2275#(and (<= main_~z~0 1) (= main_~z~0 (+ main_~y~0 1)) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:11,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {2275#(and (<= main_~z~0 1) (= main_~z~0 (+ main_~y~0 1)) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {2275#(and (<= main_~z~0 1) (= main_~z~0 (+ main_~y~0 1)) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:11,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {2275#(and (<= main_~z~0 1) (= main_~z~0 (+ main_~y~0 1)) (<= 1 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2264#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:11,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {2264#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2264#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:11,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {2264#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {2227#false} is VALID [2022-04-27 11:15:11,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {2227#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2227#false} is VALID [2022-04-27 11:15:11,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {2227#false} assume !(~y~0 % 4294967296 > 0); {2227#false} is VALID [2022-04-27 11:15:11,224 INFO L272 TraceCheckUtils]: 18: Hoare triple {2227#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2227#false} is VALID [2022-04-27 11:15:11,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {2227#false} ~cond := #in~cond; {2227#false} is VALID [2022-04-27 11:15:11,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {2227#false} assume 0 == ~cond; {2227#false} is VALID [2022-04-27 11:15:11,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {2227#false} assume !false; {2227#false} is VALID [2022-04-27 11:15:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:15:11,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:11,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {2227#false} assume !false; {2227#false} is VALID [2022-04-27 11:15:11,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {2227#false} assume 0 == ~cond; {2227#false} is VALID [2022-04-27 11:15:11,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {2227#false} ~cond := #in~cond; {2227#false} is VALID [2022-04-27 11:15:11,361 INFO L272 TraceCheckUtils]: 18: Hoare triple {2227#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2227#false} is VALID [2022-04-27 11:15:11,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {2227#false} assume !(~y~0 % 4294967296 > 0); {2227#false} is VALID [2022-04-27 11:15:11,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {2321#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2227#false} is VALID [2022-04-27 11:15:11,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {2325#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2321#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:15:11,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {2325#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {2325#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:15:11,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {2332#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2325#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:15:11,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {2332#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2332#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-27 11:15:11,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {2339#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2332#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-27 11:15:11,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {2339#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2339#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-27 11:15:11,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2339#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-27 11:15:11,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {2226#true} ~z~0 := ~y~0; {2325#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:15:11,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {2226#true} assume !(~x~0 % 4294967296 > 0); {2226#true} is VALID [2022-04-27 11:15:11,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {2226#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2226#true} is VALID [2022-04-27 11:15:11,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {2226#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2226#true} is VALID [2022-04-27 11:15:11,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {2226#true} call #t~ret17 := main(); {2226#true} is VALID [2022-04-27 11:15:11,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2226#true} {2226#true} #94#return; {2226#true} is VALID [2022-04-27 11:15:11,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {2226#true} assume true; {2226#true} is VALID [2022-04-27 11:15:11,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {2226#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(10, 2);call #Ultimate.allocInit(12, 3); {2226#true} is VALID [2022-04-27 11:15:11,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {2226#true} call ULTIMATE.init(); {2226#true} is VALID [2022-04-27 11:15:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:15:11,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224036281] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:11,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:11,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 15 [2022-04-27 11:15:11,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008424982] [2022-04-27 11:15:11,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:11,367 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:15:11,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:11,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:11,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:11,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 11:15:11,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:11,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 11:15:11,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:15:11,397 INFO L87 Difference]: Start difference. First operand 70 states and 101 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:11,956 INFO L93 Difference]: Finished difference Result 141 states and 212 transitions. [2022-04-27 11:15:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 11:15:11,957 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:15:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 83 transitions. [2022-04-27 11:15:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 83 transitions. [2022-04-27 11:15:11,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 83 transitions. [2022-04-27 11:15:12,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:12,021 INFO L225 Difference]: With dead ends: 141 [2022-04-27 11:15:12,021 INFO L226 Difference]: Without dead ends: 111 [2022-04-27 11:15:12,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2022-04-27 11:15:12,022 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 60 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:12,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 38 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:15:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-27 11:15:12,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2022-04-27 11:15:12,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:12,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 95 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:12,065 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 95 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:12,066 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 95 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:12,073 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2022-04-27 11:15:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 154 transitions. [2022-04-27 11:15:12,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:12,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:12,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-27 11:15:12,074 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-27 11:15:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:12,075 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2022-04-27 11:15:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 154 transitions. [2022-04-27 11:15:12,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:12,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:12,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:12,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2022-04-27 11:15:12,077 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 22 [2022-04-27 11:15:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:12,078 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2022-04-27 11:15:12,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2022-04-27 11:15:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:15:12,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:12,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:12,094 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:15:12,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:12,294 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:12,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:12,294 INFO L85 PathProgramCache]: Analyzing trace with hash -353925126, now seen corresponding path program 1 times [2022-04-27 11:15:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:12,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667683483] [2022-04-27 11:15:12,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:12,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:12,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:12,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {2921#(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(10, 2);call #Ultimate.allocInit(12, 3); {2912#true} is VALID [2022-04-27 11:15:12,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {2912#true} assume true; {2912#true} is VALID [2022-04-27 11:15:12,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2912#true} {2912#true} #94#return; {2912#true} is VALID [2022-04-27 11:15:12,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {2912#true} call ULTIMATE.init(); {2921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:12,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {2921#(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(10, 2);call #Ultimate.allocInit(12, 3); {2912#true} is VALID [2022-04-27 11:15:12,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {2912#true} assume true; {2912#true} is VALID [2022-04-27 11:15:12,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2912#true} {2912#true} #94#return; {2912#true} is VALID [2022-04-27 11:15:12,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {2912#true} call #t~ret17 := main(); {2912#true} is VALID [2022-04-27 11:15:12,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {2912#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2912#true} is VALID [2022-04-27 11:15:12,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {2912#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2912#true} is VALID [2022-04-27 11:15:12,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {2912#true} assume !(~x~0 % 4294967296 > 0); {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:12,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:12,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:15:12,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:15:12,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:15:12,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:15:12,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:12,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:12,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:15:12,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:15:12,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:12,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:12,402 INFO L272 TraceCheckUtils]: 19: Hoare triple {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2919#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:15:12,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {2919#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2920#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:15:12,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {2920#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2913#false} is VALID [2022-04-27 11:15:12,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {2913#false} assume !false; {2913#false} is VALID [2022-04-27 11:15:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:12,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667683483] [2022-04-27 11:15:12,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667683483] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:12,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751781408] [2022-04-27 11:15:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:12,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:12,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:12,405 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:15:12,405 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:15:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:12,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:15:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:12,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:12,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {2912#true} call ULTIMATE.init(); {2912#true} is VALID [2022-04-27 11:15:12,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {2912#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(10, 2);call #Ultimate.allocInit(12, 3); {2912#true} is VALID [2022-04-27 11:15:12,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {2912#true} assume true; {2912#true} is VALID [2022-04-27 11:15:12,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2912#true} {2912#true} #94#return; {2912#true} is VALID [2022-04-27 11:15:12,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {2912#true} call #t~ret17 := main(); {2912#true} is VALID [2022-04-27 11:15:12,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {2912#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2912#true} is VALID [2022-04-27 11:15:12,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {2912#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2912#true} is VALID [2022-04-27 11:15:12,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {2912#true} assume !(~x~0 % 4294967296 > 0); {2912#true} is VALID [2022-04-27 11:15:12,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {2912#true} ~z~0 := ~y~0; {2912#true} is VALID [2022-04-27 11:15:12,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {2912#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2912#true} is VALID [2022-04-27 11:15:12,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {2912#true} assume !(~z~0 % 4294967296 > 0); {2912#true} is VALID [2022-04-27 11:15:12,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {2912#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2912#true} is VALID [2022-04-27 11:15:12,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {2912#true} assume !(~y~0 % 4294967296 > 0); {2912#true} is VALID [2022-04-27 11:15:12,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {2912#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2912#true} is VALID [2022-04-27 11:15:12,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {2912#true} assume !(~x~0 % 4294967296 > 0); {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:12,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:15:12,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:15:12,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:12,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:12,639 INFO L272 TraceCheckUtils]: 19: Hoare triple {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:15:12,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:15:12,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {2986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2913#false} is VALID [2022-04-27 11:15:12,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {2913#false} assume !false; {2913#false} is VALID [2022-04-27 11:15:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:15:12,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:12,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {2913#false} assume !false; {2913#false} is VALID [2022-04-27 11:15:12,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {2986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2913#false} is VALID [2022-04-27 11:15:12,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:15:12,729 INFO L272 TraceCheckUtils]: 19: Hoare triple {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:15:12,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:12,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:12,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:15:12,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2918#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:15:12,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {2912#true} assume !(~x~0 % 4294967296 > 0); {2917#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:12,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {2912#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2912#true} is VALID [2022-04-27 11:15:12,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {2912#true} assume !(~y~0 % 4294967296 > 0); {2912#true} is VALID [2022-04-27 11:15:12,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {2912#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2912#true} is VALID [2022-04-27 11:15:12,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {2912#true} assume !(~z~0 % 4294967296 > 0); {2912#true} is VALID [2022-04-27 11:15:12,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {2912#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2912#true} is VALID [2022-04-27 11:15:12,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {2912#true} ~z~0 := ~y~0; {2912#true} is VALID [2022-04-27 11:15:12,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {2912#true} assume !(~x~0 % 4294967296 > 0); {2912#true} is VALID [2022-04-27 11:15:12,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {2912#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2912#true} is VALID [2022-04-27 11:15:12,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {2912#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2912#true} is VALID [2022-04-27 11:15:12,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {2912#true} call #t~ret17 := main(); {2912#true} is VALID [2022-04-27 11:15:12,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2912#true} {2912#true} #94#return; {2912#true} is VALID [2022-04-27 11:15:12,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {2912#true} assume true; {2912#true} is VALID [2022-04-27 11:15:12,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {2912#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(10, 2);call #Ultimate.allocInit(12, 3); {2912#true} is VALID [2022-04-27 11:15:12,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {2912#true} call ULTIMATE.init(); {2912#true} is VALID [2022-04-27 11:15:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:15:12,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751781408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:12,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:12,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-27 11:15:12,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158467158] [2022-04-27 11:15:12,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:12,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:15:12,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:12,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:12,758 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:15:12,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:15:12,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:12,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:15:12,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:15:12,759 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:13,075 INFO L93 Difference]: Finished difference Result 147 states and 212 transitions. [2022-04-27 11:15:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:15:13,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:15:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-27 11:15:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-27 11:15:13,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-04-27 11:15:13,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:13,118 INFO L225 Difference]: With dead ends: 147 [2022-04-27 11:15:13,118 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 11:15:13,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:15:13,119 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:13,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 52 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:15:13,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 11:15:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 80. [2022-04-27 11:15:13,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:13,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 80 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:13,165 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 80 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:13,165 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 80 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:13,167 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2022-04-27 11:15:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2022-04-27 11:15:13,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:13,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:13,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-27 11:15:13,168 INFO L87 Difference]: Start difference. First operand has 80 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-27 11:15:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:13,169 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2022-04-27 11:15:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2022-04-27 11:15:13,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:13,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:13,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:13,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2022-04-27 11:15:13,171 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 23 [2022-04-27 11:15:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:13,171 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2022-04-27 11:15:13,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2022-04-27 11:15:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 11:15:13,172 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:13,172 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:13,190 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:15:13,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 11:15:13,389 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:13,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:13,389 INFO L85 PathProgramCache]: Analyzing trace with hash -277419979, now seen corresponding path program 2 times [2022-04-27 11:15:13,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:13,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107259400] [2022-04-27 11:15:13,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:13,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:13,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:13,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {3551#(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(10, 2);call #Ultimate.allocInit(12, 3); {3541#true} is VALID [2022-04-27 11:15:13,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {3541#true} assume true; {3541#true} is VALID [2022-04-27 11:15:13,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3541#true} {3541#true} #94#return; {3541#true} is VALID [2022-04-27 11:15:13,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {3541#true} call ULTIMATE.init(); {3551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:13,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {3551#(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(10, 2);call #Ultimate.allocInit(12, 3); {3541#true} is VALID [2022-04-27 11:15:13,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {3541#true} assume true; {3541#true} is VALID [2022-04-27 11:15:13,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3541#true} {3541#true} #94#return; {3541#true} is VALID [2022-04-27 11:15:13,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {3541#true} call #t~ret17 := main(); {3541#true} is VALID [2022-04-27 11:15:13,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {3541#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3546#(= main_~y~0 0)} is VALID [2022-04-27 11:15:13,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {3546#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3547#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:13,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {3547#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3548#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:13,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {3548#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3548#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:13,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {3548#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3549#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:13,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {3549#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3550#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:13,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {3550#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {3542#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3542#false} is VALID [2022-04-27 11:15:13,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {3542#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3542#false} is VALID [2022-04-27 11:15:13,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {3542#false} assume !(~y~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {3542#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3542#false} is VALID [2022-04-27 11:15:13,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {3542#false} assume !(~x~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {3542#false} assume !(~z~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {3542#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3542#false} is VALID [2022-04-27 11:15:13,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {3542#false} assume !(~y~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,463 INFO L272 TraceCheckUtils]: 20: Hoare triple {3542#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3542#false} is VALID [2022-04-27 11:15:13,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {3542#false} ~cond := #in~cond; {3542#false} is VALID [2022-04-27 11:15:13,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {3542#false} assume 0 == ~cond; {3542#false} is VALID [2022-04-27 11:15:13,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {3542#false} assume !false; {3542#false} is VALID [2022-04-27 11:15:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 11:15:13,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:13,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107259400] [2022-04-27 11:15:13,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107259400] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:13,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018188518] [2022-04-27 11:15:13,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:15:13,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:13,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:13,465 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:15:13,466 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:15:13,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:15:13,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:13,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:15:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:13,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:13,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {3541#true} call ULTIMATE.init(); {3541#true} is VALID [2022-04-27 11:15:13,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {3541#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(10, 2);call #Ultimate.allocInit(12, 3); {3541#true} is VALID [2022-04-27 11:15:13,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {3541#true} assume true; {3541#true} is VALID [2022-04-27 11:15:13,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3541#true} {3541#true} #94#return; {3541#true} is VALID [2022-04-27 11:15:13,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {3541#true} call #t~ret17 := main(); {3541#true} is VALID [2022-04-27 11:15:13,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {3541#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3546#(= main_~y~0 0)} is VALID [2022-04-27 11:15:13,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {3546#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3547#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:13,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {3547#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3548#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:13,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {3548#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3548#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:13,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {3548#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3582#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:13,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {3582#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3586#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:15:13,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {3586#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {3542#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3542#false} is VALID [2022-04-27 11:15:13,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {3542#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3542#false} is VALID [2022-04-27 11:15:13,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {3542#false} assume !(~y~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {3542#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3542#false} is VALID [2022-04-27 11:15:13,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {3542#false} assume !(~x~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {3542#false} assume !(~z~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {3542#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3542#false} is VALID [2022-04-27 11:15:13,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {3542#false} assume !(~y~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,614 INFO L272 TraceCheckUtils]: 20: Hoare triple {3542#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3542#false} is VALID [2022-04-27 11:15:13,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {3542#false} ~cond := #in~cond; {3542#false} is VALID [2022-04-27 11:15:13,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {3542#false} assume 0 == ~cond; {3542#false} is VALID [2022-04-27 11:15:13,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {3542#false} assume !false; {3542#false} is VALID [2022-04-27 11:15:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 11:15:13,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:13,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {3542#false} assume !false; {3542#false} is VALID [2022-04-27 11:15:13,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {3542#false} assume 0 == ~cond; {3542#false} is VALID [2022-04-27 11:15:13,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {3542#false} ~cond := #in~cond; {3542#false} is VALID [2022-04-27 11:15:13,724 INFO L272 TraceCheckUtils]: 20: Hoare triple {3542#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3542#false} is VALID [2022-04-27 11:15:13,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {3542#false} assume !(~y~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {3542#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3542#false} is VALID [2022-04-27 11:15:13,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {3542#false} assume !(~z~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {3542#false} assume !(~x~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {3542#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3542#false} is VALID [2022-04-27 11:15:13,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {3542#false} assume !(~y~0 % 4294967296 > 0); {3542#false} is VALID [2022-04-27 11:15:13,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {3656#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3542#false} is VALID [2022-04-27 11:15:13,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {3660#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3656#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:15:13,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {3664#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3660#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:15:13,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {3668#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3664#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:15:13,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {3541#true} ~z~0 := ~y~0; {3668#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:15:13,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {3541#true} assume !(~x~0 % 4294967296 > 0); {3541#true} is VALID [2022-04-27 11:15:13,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {3541#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3541#true} is VALID [2022-04-27 11:15:13,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {3541#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3541#true} is VALID [2022-04-27 11:15:13,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {3541#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3541#true} is VALID [2022-04-27 11:15:13,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {3541#true} call #t~ret17 := main(); {3541#true} is VALID [2022-04-27 11:15:13,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3541#true} {3541#true} #94#return; {3541#true} is VALID [2022-04-27 11:15:13,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {3541#true} assume true; {3541#true} is VALID [2022-04-27 11:15:13,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {3541#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(10, 2);call #Ultimate.allocInit(12, 3); {3541#true} is VALID [2022-04-27 11:15:13,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {3541#true} call ULTIMATE.init(); {3541#true} is VALID [2022-04-27 11:15:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 11:15:13,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018188518] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:13,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:13,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-27 11:15:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142419617] [2022-04-27 11:15:13,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:13,736 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 11:15:13,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:13,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:13,756 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:15:13,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:15:13,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:13,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:15:13,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:15:13,757 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:14,313 INFO L93 Difference]: Finished difference Result 135 states and 198 transitions. [2022-04-27 11:15:14,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 11:15:14,313 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 11:15:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 93 transitions. [2022-04-27 11:15:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 93 transitions. [2022-04-27 11:15:14,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 93 transitions. [2022-04-27 11:15:14,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:14,385 INFO L225 Difference]: With dead ends: 135 [2022-04-27 11:15:14,385 INFO L226 Difference]: Without dead ends: 90 [2022-04-27 11:15:14,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-04-27 11:15:14,387 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 88 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:14,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 42 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:15:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-27 11:15:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2022-04-27 11:15:14,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:14,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 75 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 70 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:14,429 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 75 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 70 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:14,429 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 75 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 70 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:14,430 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2022-04-27 11:15:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2022-04-27 11:15:14,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:14,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:14,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 70 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-27 11:15:14,431 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 70 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-27 11:15:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:14,432 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2022-04-27 11:15:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2022-04-27 11:15:14,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:14,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:14,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:14,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 70 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2022-04-27 11:15:14,434 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 24 [2022-04-27 11:15:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:14,434 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2022-04-27 11:15:14,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2022-04-27 11:15:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 11:15:14,434 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:14,434 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:14,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 11:15:14,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:14,653 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:14,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:14,653 INFO L85 PathProgramCache]: Analyzing trace with hash 489571588, now seen corresponding path program 2 times [2022-04-27 11:15:14,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:14,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439672362] [2022-04-27 11:15:14,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:14,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:14,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {4183#(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(10, 2);call #Ultimate.allocInit(12, 3); {4171#true} is VALID [2022-04-27 11:15:14,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {4171#true} assume true; {4171#true} is VALID [2022-04-27 11:15:14,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4171#true} {4171#true} #94#return; {4171#true} is VALID [2022-04-27 11:15:14,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {4171#true} call ULTIMATE.init(); {4183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:14,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {4183#(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(10, 2);call #Ultimate.allocInit(12, 3); {4171#true} is VALID [2022-04-27 11:15:14,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {4171#true} assume true; {4171#true} is VALID [2022-04-27 11:15:14,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4171#true} {4171#true} #94#return; {4171#true} is VALID [2022-04-27 11:15:14,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {4171#true} call #t~ret17 := main(); {4171#true} is VALID [2022-04-27 11:15:14,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {4171#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4176#(= main_~y~0 0)} is VALID [2022-04-27 11:15:14,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {4176#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4177#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:14,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {4177#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4178#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:14,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {4178#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {4178#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:14,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {4178#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {4179#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:14,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {4179#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4180#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:14,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {4180#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4181#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:14,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {4181#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4181#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:14,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {4181#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4180#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:14,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {4180#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4179#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:14,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {4179#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {4179#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:14,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {4179#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {4179#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:14,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {4179#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4182#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:14,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {4182#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4172#false} is VALID [2022-04-27 11:15:14,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {4172#false} assume !(~y~0 % 4294967296 > 0); {4172#false} is VALID [2022-04-27 11:15:14,782 INFO L272 TraceCheckUtils]: 20: Hoare triple {4172#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4172#false} is VALID [2022-04-27 11:15:14,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {4172#false} ~cond := #in~cond; {4172#false} is VALID [2022-04-27 11:15:14,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {4172#false} assume 0 == ~cond; {4172#false} is VALID [2022-04-27 11:15:14,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {4172#false} assume !false; {4172#false} is VALID [2022-04-27 11:15:14,782 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:15:14,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:14,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439672362] [2022-04-27 11:15:14,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439672362] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:14,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040921948] [2022-04-27 11:15:14,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:15:14,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:14,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:14,783 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:15:14,784 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:15:14,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:15:14,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:14,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:15:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:14,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:14,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {4171#true} call ULTIMATE.init(); {4171#true} is VALID [2022-04-27 11:15:14,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {4171#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(10, 2);call #Ultimate.allocInit(12, 3); {4171#true} is VALID [2022-04-27 11:15:14,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {4171#true} assume true; {4171#true} is VALID [2022-04-27 11:15:14,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4171#true} {4171#true} #94#return; {4171#true} is VALID [2022-04-27 11:15:14,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {4171#true} call #t~ret17 := main(); {4171#true} is VALID [2022-04-27 11:15:14,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {4171#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4171#true} is VALID [2022-04-27 11:15:14,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {4171#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4205#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:14,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {4205#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4209#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:14,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {4209#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4209#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:14,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {4209#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {4209#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:14,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {4209#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4205#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:14,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {4205#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4222#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:14,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {4222#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4222#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:14,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {4222#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4222#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:14,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {4222#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4222#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:14,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {4222#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4222#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:14,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {4222#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4172#false} is VALID [2022-04-27 11:15:14,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {4172#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4172#false} is VALID [2022-04-27 11:15:14,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {4172#false} assume !(~z~0 % 4294967296 > 0); {4172#false} is VALID [2022-04-27 11:15:14,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {4172#false} assume !(~y~0 % 4294967296 > 0); {4172#false} is VALID [2022-04-27 11:15:14,899 INFO L272 TraceCheckUtils]: 20: Hoare triple {4172#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4172#false} is VALID [2022-04-27 11:15:14,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {4172#false} ~cond := #in~cond; {4172#false} is VALID [2022-04-27 11:15:14,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {4172#false} assume 0 == ~cond; {4172#false} is VALID [2022-04-27 11:15:14,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {4172#false} assume !false; {4172#false} is VALID [2022-04-27 11:15:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:15:14,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:14,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {4172#false} assume !false; {4172#false} is VALID [2022-04-27 11:15:14,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {4172#false} assume 0 == ~cond; {4172#false} is VALID [2022-04-27 11:15:14,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {4172#false} ~cond := #in~cond; {4172#false} is VALID [2022-04-27 11:15:14,979 INFO L272 TraceCheckUtils]: 20: Hoare triple {4172#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4172#false} is VALID [2022-04-27 11:15:14,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {4172#false} assume !(~y~0 % 4294967296 > 0); {4172#false} is VALID [2022-04-27 11:15:14,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {4172#false} assume !(~z~0 % 4294967296 > 0); {4172#false} is VALID [2022-04-27 11:15:14,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {4172#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4172#false} is VALID [2022-04-27 11:15:14,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {4222#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4172#false} is VALID [2022-04-27 11:15:14,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {4222#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4222#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:14,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {4222#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4222#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:14,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {4222#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4222#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:14,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {4222#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4222#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:14,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {4205#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4222#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:14,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {4209#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4205#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:14,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {4209#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {4209#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:14,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {4209#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4209#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:14,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {4205#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4209#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:14,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {4171#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4205#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:14,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {4171#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4171#true} is VALID [2022-04-27 11:15:14,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {4171#true} call #t~ret17 := main(); {4171#true} is VALID [2022-04-27 11:15:14,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4171#true} {4171#true} #94#return; {4171#true} is VALID [2022-04-27 11:15:14,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {4171#true} assume true; {4171#true} is VALID [2022-04-27 11:15:14,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {4171#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(10, 2);call #Ultimate.allocInit(12, 3); {4171#true} is VALID [2022-04-27 11:15:14,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {4171#true} call ULTIMATE.init(); {4171#true} is VALID [2022-04-27 11:15:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:15:14,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040921948] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:14,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:14,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2022-04-27 11:15:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275606495] [2022-04-27 11:15:14,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:14,986 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 11:15:14,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:14,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:15,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:15,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:15:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:15:15,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:15:15,017 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:16,347 INFO L93 Difference]: Finished difference Result 162 states and 241 transitions. [2022-04-27 11:15:16,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 11:15:16,347 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 11:15:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 128 transitions. [2022-04-27 11:15:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 128 transitions. [2022-04-27 11:15:16,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 128 transitions. [2022-04-27 11:15:16,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:16,469 INFO L225 Difference]: With dead ends: 162 [2022-04-27 11:15:16,469 INFO L226 Difference]: Without dead ends: 127 [2022-04-27 11:15:16,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=1240, Unknown=0, NotChecked=0, Total=1482 [2022-04-27 11:15:16,470 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 82 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:16,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 74 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:15:16,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-27 11:15:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 94. [2022-04-27 11:15:16,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:16,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 94 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:16,540 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 94 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:16,540 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 94 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:16,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:16,542 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2022-04-27 11:15:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 170 transitions. [2022-04-27 11:15:16,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:16,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:16,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 127 states. [2022-04-27 11:15:16,543 INFO L87 Difference]: Start difference. First operand has 94 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 127 states. [2022-04-27 11:15:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:16,545 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2022-04-27 11:15:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 170 transitions. [2022-04-27 11:15:16,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:16,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:16,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:16,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2022-04-27 11:15:16,547 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 125 transitions. Word has length 24 [2022-04-27 11:15:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:16,547 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 125 transitions. [2022-04-27 11:15:16,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2022-04-27 11:15:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:15:16,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:16,548 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:16,564 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:15:16,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:16,759 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:16,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:16,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1340816406, now seen corresponding path program 3 times [2022-04-27 11:15:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:16,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111481271] [2022-04-27 11:15:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:16,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {4964#(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(10, 2);call #Ultimate.allocInit(12, 3); {4952#true} is VALID [2022-04-27 11:15:16,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {4952#true} assume true; {4952#true} is VALID [2022-04-27 11:15:16,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4952#true} {4952#true} #94#return; {4952#true} is VALID [2022-04-27 11:15:16,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {4952#true} call ULTIMATE.init(); {4964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:16,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {4964#(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(10, 2);call #Ultimate.allocInit(12, 3); {4952#true} is VALID [2022-04-27 11:15:16,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {4952#true} assume true; {4952#true} is VALID [2022-04-27 11:15:16,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4952#true} {4952#true} #94#return; {4952#true} is VALID [2022-04-27 11:15:16,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {4952#true} call #t~ret17 := main(); {4952#true} is VALID [2022-04-27 11:15:16,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {4952#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4957#(= main_~y~0 0)} is VALID [2022-04-27 11:15:16,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {4957#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4958#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:16,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {4958#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4959#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:16,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {4959#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4960#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:16,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {4960#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4960#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:16,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {4960#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {4961#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:16,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {4961#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4962#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:16,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {4962#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4963#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:16,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {4963#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4953#false} is VALID [2022-04-27 11:15:16,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {4953#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4953#false} is VALID [2022-04-27 11:15:16,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {4953#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4953#false} is VALID [2022-04-27 11:15:16,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {4953#false} assume !(~y~0 % 4294967296 > 0); {4953#false} is VALID [2022-04-27 11:15:16,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {4953#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4953#false} is VALID [2022-04-27 11:15:16,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {4953#false} assume !(~x~0 % 4294967296 > 0); {4953#false} is VALID [2022-04-27 11:15:16,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {4953#false} assume !(~z~0 % 4294967296 > 0); {4953#false} is VALID [2022-04-27 11:15:16,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {4953#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4953#false} is VALID [2022-04-27 11:15:16,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {4953#false} assume !(~y~0 % 4294967296 > 0); {4953#false} is VALID [2022-04-27 11:15:16,873 INFO L272 TraceCheckUtils]: 22: Hoare triple {4953#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4953#false} is VALID [2022-04-27 11:15:16,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {4953#false} ~cond := #in~cond; {4953#false} is VALID [2022-04-27 11:15:16,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {4953#false} assume 0 == ~cond; {4953#false} is VALID [2022-04-27 11:15:16,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {4953#false} assume !false; {4953#false} is VALID [2022-04-27 11:15:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 11:15:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:16,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111481271] [2022-04-27 11:15:16,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111481271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:16,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270316348] [2022-04-27 11:15:16,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:15:16,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:16,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:16,874 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:15:16,875 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:15:16,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:15:16,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:16,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:15:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:16,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:17,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {4952#true} call ULTIMATE.init(); {4952#true} is VALID [2022-04-27 11:15:17,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {4952#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(10, 2);call #Ultimate.allocInit(12, 3); {4952#true} is VALID [2022-04-27 11:15:17,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {4952#true} assume true; {4952#true} is VALID [2022-04-27 11:15:17,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4952#true} {4952#true} #94#return; {4952#true} is VALID [2022-04-27 11:15:17,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {4952#true} call #t~ret17 := main(); {4952#true} is VALID [2022-04-27 11:15:17,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {4952#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4952#true} is VALID [2022-04-27 11:15:17,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {4952#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4952#true} is VALID [2022-04-27 11:15:17,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {4952#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4952#true} is VALID [2022-04-27 11:15:17,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {4952#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4952#true} is VALID [2022-04-27 11:15:17,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {4952#true} assume !(~x~0 % 4294967296 > 0); {4995#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:17,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {4995#(not (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {4995#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:17,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {4995#(not (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:15:17,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:15:17,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:15:17,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:15:17,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:15:17,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:15:17,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:15:17,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:15:17,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:15:17,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4995#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:17,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {4995#(not (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4995#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:17,150 INFO L272 TraceCheckUtils]: 22: Hoare triple {4995#(not (< 0 (mod main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5037#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:15:17,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {5037#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5041#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:15:17,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {5041#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4953#false} is VALID [2022-04-27 11:15:17,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {4953#false} assume !false; {4953#false} is VALID [2022-04-27 11:15:17,151 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:15:17,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:17,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {4953#false} assume !false; {4953#false} is VALID [2022-04-27 11:15:17,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {5041#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4953#false} is VALID [2022-04-27 11:15:17,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {5037#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5041#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:15:17,279 INFO L272 TraceCheckUtils]: 22: Hoare triple {4995#(not (< 0 (mod main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5037#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:15:17,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {4995#(not (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4995#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:17,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4995#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:17,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:15:17,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:15:17,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:15:17,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:15:17,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:15:17,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:15:17,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:15:17,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5006#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:15:17,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {4995#(not (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5002#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:15:17,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {4995#(not (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {4995#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:17,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {4952#true} assume !(~x~0 % 4294967296 > 0); {4995#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:15:17,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {4952#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4952#true} is VALID [2022-04-27 11:15:17,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {4952#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4952#true} is VALID [2022-04-27 11:15:17,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {4952#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4952#true} is VALID [2022-04-27 11:15:17,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {4952#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4952#true} is VALID [2022-04-27 11:15:17,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {4952#true} call #t~ret17 := main(); {4952#true} is VALID [2022-04-27 11:15:17,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4952#true} {4952#true} #94#return; {4952#true} is VALID [2022-04-27 11:15:17,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {4952#true} assume true; {4952#true} is VALID [2022-04-27 11:15:17,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {4952#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(10, 2);call #Ultimate.allocInit(12, 3); {4952#true} is VALID [2022-04-27 11:15:17,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {4952#true} call ULTIMATE.init(); {4952#true} is VALID [2022-04-27 11:15:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:15:17,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270316348] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:17,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:17,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-04-27 11:15:17,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632776538] [2022-04-27 11:15:17,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:17,286 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:15:17,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:17,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:17,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:17,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 11:15:17,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:17,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 11:15:17,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:15:17,318 INFO L87 Difference]: Start difference. First operand 94 states and 125 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:18,979 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2022-04-27 11:15:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 11:15:18,979 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:15:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 166 transitions. [2022-04-27 11:15:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 166 transitions. [2022-04-27 11:15:18,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 166 transitions. [2022-04-27 11:15:19,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:19,120 INFO L225 Difference]: With dead ends: 199 [2022-04-27 11:15:19,120 INFO L226 Difference]: Without dead ends: 131 [2022-04-27 11:15:19,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 11:15:19,121 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 93 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:19,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 84 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 11:15:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-27 11:15:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2022-04-27 11:15:19,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:19,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:19,196 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:19,196 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:19,198 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2022-04-27 11:15:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2022-04-27 11:15:19,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:19,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:19,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-27 11:15:19,199 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-27 11:15:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:19,201 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2022-04-27 11:15:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2022-04-27 11:15:19,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:19,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:19,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:19,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2022-04-27 11:15:19,202 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 26 [2022-04-27 11:15:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:19,203 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2022-04-27 11:15:19,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2022-04-27 11:15:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:15:19,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:19,203 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:19,220 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:15:19,420 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,SelfDestructingSolverStorable12 [2022-04-27 11:15:19,420 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:19,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash -812701032, now seen corresponding path program 3 times [2022-04-27 11:15:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:19,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407252462] [2022-04-27 11:15:19,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:19,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:19,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:19,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {5807#(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(10, 2);call #Ultimate.allocInit(12, 3); {5793#true} is VALID [2022-04-27 11:15:19,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-27 11:15:19,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5793#true} {5793#true} #94#return; {5793#true} is VALID [2022-04-27 11:15:19,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {5793#true} call ULTIMATE.init(); {5807#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:19,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {5807#(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(10, 2);call #Ultimate.allocInit(12, 3); {5793#true} is VALID [2022-04-27 11:15:19,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-27 11:15:19,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5793#true} {5793#true} #94#return; {5793#true} is VALID [2022-04-27 11:15:19,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {5793#true} call #t~ret17 := main(); {5793#true} is VALID [2022-04-27 11:15:19,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {5793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5798#(= main_~y~0 0)} is VALID [2022-04-27 11:15:19,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {5798#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:19,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {5799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:19,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {5800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:19,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {5801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:19,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {5801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5802#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:19,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {5802#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5803#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:19,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {5803#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5804#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:19,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {5804#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5805#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:19,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {5805#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5805#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:19,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {5805#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5804#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:19,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {5804#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5803#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:19,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {5803#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5802#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:19,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {5802#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {5802#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:19,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {5802#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {5802#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:19,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {5802#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5806#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:19,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {5806#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5794#false} is VALID [2022-04-27 11:15:19,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {5794#false} assume !(~y~0 % 4294967296 > 0); {5794#false} is VALID [2022-04-27 11:15:19,566 INFO L272 TraceCheckUtils]: 23: Hoare triple {5794#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5794#false} is VALID [2022-04-27 11:15:19,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {5794#false} ~cond := #in~cond; {5794#false} is VALID [2022-04-27 11:15:19,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {5794#false} assume 0 == ~cond; {5794#false} is VALID [2022-04-27 11:15:19,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {5794#false} assume !false; {5794#false} is VALID [2022-04-27 11:15:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:19,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:19,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407252462] [2022-04-27 11:15:19,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407252462] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:19,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154639030] [2022-04-27 11:15:19,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:15:19,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:19,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:19,567 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:15:19,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 11:15:19,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:15:19,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:19,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:15:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:19,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:19,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {5793#true} call ULTIMATE.init(); {5793#true} is VALID [2022-04-27 11:15:19,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {5793#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(10, 2);call #Ultimate.allocInit(12, 3); {5793#true} is VALID [2022-04-27 11:15:19,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-27 11:15:19,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5793#true} {5793#true} #94#return; {5793#true} is VALID [2022-04-27 11:15:19,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {5793#true} call #t~ret17 := main(); {5793#true} is VALID [2022-04-27 11:15:19,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {5793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5793#true} is VALID [2022-04-27 11:15:19,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {5793#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5829#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:19,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {5829#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5833#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:19,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {5833#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5837#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:19,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {5837#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5837#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:19,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {5837#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {5837#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:19,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {5837#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5833#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:19,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {5833#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5829#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:19,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {5829#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5853#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:19,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {5853#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5853#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:19,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {5853#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5853#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:19,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {5853#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5853#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:19,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {5853#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5853#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:19,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {5853#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5853#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:19,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {5853#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5794#false} is VALID [2022-04-27 11:15:19,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {5794#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5794#false} is VALID [2022-04-27 11:15:19,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {5794#false} assume !(~z~0 % 4294967296 > 0); {5794#false} is VALID [2022-04-27 11:15:19,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {5794#false} assume !(~y~0 % 4294967296 > 0); {5794#false} is VALID [2022-04-27 11:15:19,737 INFO L272 TraceCheckUtils]: 23: Hoare triple {5794#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5794#false} is VALID [2022-04-27 11:15:19,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {5794#false} ~cond := #in~cond; {5794#false} is VALID [2022-04-27 11:15:19,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {5794#false} assume 0 == ~cond; {5794#false} is VALID [2022-04-27 11:15:19,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {5794#false} assume !false; {5794#false} is VALID [2022-04-27 11:15:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:15:19,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:19,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {5794#false} assume !false; {5794#false} is VALID [2022-04-27 11:15:19,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {5794#false} assume 0 == ~cond; {5794#false} is VALID [2022-04-27 11:15:19,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {5794#false} ~cond := #in~cond; {5794#false} is VALID [2022-04-27 11:15:19,824 INFO L272 TraceCheckUtils]: 23: Hoare triple {5794#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5794#false} is VALID [2022-04-27 11:15:19,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {5794#false} assume !(~y~0 % 4294967296 > 0); {5794#false} is VALID [2022-04-27 11:15:19,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {5794#false} assume !(~z~0 % 4294967296 > 0); {5794#false} is VALID [2022-04-27 11:15:19,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {5794#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5794#false} is VALID [2022-04-27 11:15:19,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {5853#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5794#false} is VALID [2022-04-27 11:15:19,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {5853#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5853#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:19,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {5853#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5853#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:19,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {5853#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5853#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:19,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {5853#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5853#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:19,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {5853#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5853#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:19,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {5829#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5853#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:19,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {5833#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5829#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:19,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {5837#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5833#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:19,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {5837#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {5837#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:19,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {5837#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5837#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:19,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {5833#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5837#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:19,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {5829#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5833#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:19,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {5793#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5829#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:19,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {5793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5793#true} is VALID [2022-04-27 11:15:19,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {5793#true} call #t~ret17 := main(); {5793#true} is VALID [2022-04-27 11:15:19,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5793#true} {5793#true} #94#return; {5793#true} is VALID [2022-04-27 11:15:19,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-27 11:15:19,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {5793#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(10, 2);call #Ultimate.allocInit(12, 3); {5793#true} is VALID [2022-04-27 11:15:19,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {5793#true} call ULTIMATE.init(); {5793#true} is VALID [2022-04-27 11:15:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:15:19,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154639030] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:19,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:19,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-27 11:15:19,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704410203] [2022-04-27 11:15:19,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:19,832 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:15:19,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:19,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:19,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:19,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:15:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:15:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:15:19,861 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:22,438 INFO L93 Difference]: Finished difference Result 200 states and 291 transitions. [2022-04-27 11:15:22,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-27 11:15:22,438 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:15:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2022-04-27 11:15:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:22,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2022-04-27 11:15:22,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 175 transitions. [2022-04-27 11:15:22,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:22,614 INFO L225 Difference]: With dead ends: 200 [2022-04-27 11:15:22,614 INFO L226 Difference]: Without dead ends: 163 [2022-04-27 11:15:22,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=460, Invalid=3080, Unknown=0, NotChecked=0, Total=3540 [2022-04-27 11:15:22,616 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 109 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:22,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 88 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 11:15:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-27 11:15:22,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 111. [2022-04-27 11:15:22,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:22,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 111 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:22,689 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 111 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:22,690 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 111 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:22,692 INFO L93 Difference]: Finished difference Result 163 states and 217 transitions. [2022-04-27 11:15:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 217 transitions. [2022-04-27 11:15:22,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:22,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:22,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-27 11:15:22,692 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-27 11:15:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:22,694 INFO L93 Difference]: Finished difference Result 163 states and 217 transitions. [2022-04-27 11:15:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 217 transitions. [2022-04-27 11:15:22,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:22,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:22,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:22,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 146 transitions. [2022-04-27 11:15:22,696 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 146 transitions. Word has length 27 [2022-04-27 11:15:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:22,697 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 146 transitions. [2022-04-27 11:15:22,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 146 transitions. [2022-04-27 11:15:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:15:22,697 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:22,697 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:22,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 11:15:22,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 11:15:22,912 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:22,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:22,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1851792245, now seen corresponding path program 4 times [2022-04-27 11:15:22,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:22,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755085004] [2022-04-27 11:15:22,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:22,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:23,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:23,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {6782#(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(10, 2);call #Ultimate.allocInit(12, 3); {6769#true} is VALID [2022-04-27 11:15:23,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {6769#true} assume true; {6769#true} is VALID [2022-04-27 11:15:23,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6769#true} {6769#true} #94#return; {6769#true} is VALID [2022-04-27 11:15:23,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {6769#true} call ULTIMATE.init(); {6782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:23,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {6782#(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(10, 2);call #Ultimate.allocInit(12, 3); {6769#true} is VALID [2022-04-27 11:15:23,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {6769#true} assume true; {6769#true} is VALID [2022-04-27 11:15:23,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6769#true} {6769#true} #94#return; {6769#true} is VALID [2022-04-27 11:15:23,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {6769#true} call #t~ret17 := main(); {6769#true} is VALID [2022-04-27 11:15:23,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {6769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6774#(= main_~y~0 0)} is VALID [2022-04-27 11:15:23,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {6774#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:23,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {6775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6776#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:23,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {6776#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6777#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:23,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {6777#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:23,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:23,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {6779#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:15:23,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {6779#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6780#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:23,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {6780#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6781#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:23,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {6781#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6770#false} is VALID [2022-04-27 11:15:23,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {6770#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6770#false} is VALID [2022-04-27 11:15:23,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {6770#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6770#false} is VALID [2022-04-27 11:15:23,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {6770#false} assume !(~y~0 % 4294967296 > 0); {6770#false} is VALID [2022-04-27 11:15:23,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {6770#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6770#false} is VALID [2022-04-27 11:15:23,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {6770#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6770#false} is VALID [2022-04-27 11:15:23,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {6770#false} assume !(~x~0 % 4294967296 > 0); {6770#false} is VALID [2022-04-27 11:15:23,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {6770#false} assume !(~z~0 % 4294967296 > 0); {6770#false} is VALID [2022-04-27 11:15:23,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {6770#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {6770#false} is VALID [2022-04-27 11:15:23,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {6770#false} assume !(~y~0 % 4294967296 > 0); {6770#false} is VALID [2022-04-27 11:15:23,027 INFO L272 TraceCheckUtils]: 24: Hoare triple {6770#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6770#false} is VALID [2022-04-27 11:15:23,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {6770#false} ~cond := #in~cond; {6770#false} is VALID [2022-04-27 11:15:23,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {6770#false} assume 0 == ~cond; {6770#false} is VALID [2022-04-27 11:15:23,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {6770#false} assume !false; {6770#false} is VALID [2022-04-27 11:15:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:15:23,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:23,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755085004] [2022-04-27 11:15:23,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755085004] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:23,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097081766] [2022-04-27 11:15:23,028 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:15:23,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:23,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:23,042 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:15:23,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 11:15:23,079 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:15:23,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:23,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 11:15:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:23,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:23,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {6769#true} call ULTIMATE.init(); {6769#true} is VALID [2022-04-27 11:15:23,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {6769#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(10, 2);call #Ultimate.allocInit(12, 3); {6769#true} is VALID [2022-04-27 11:15:23,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {6769#true} assume true; {6769#true} is VALID [2022-04-27 11:15:23,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6769#true} {6769#true} #94#return; {6769#true} is VALID [2022-04-27 11:15:23,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {6769#true} call #t~ret17 := main(); {6769#true} is VALID [2022-04-27 11:15:23,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {6769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6774#(= main_~y~0 0)} is VALID [2022-04-27 11:15:23,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {6774#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:23,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {6775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6776#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:23,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {6776#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6777#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:23,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {6777#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:23,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:23,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:23,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:23,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:23,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:23,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6777#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:23,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {6777#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6776#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:23,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {6776#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~y~0 % 4294967296 > 0); {6776#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:23,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {6776#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6777#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:23,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {6777#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:23,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:23,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:23,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {6778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {6777#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:23,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {6777#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~y~0 % 4294967296 > 0); {6770#false} is VALID [2022-04-27 11:15:23,340 INFO L272 TraceCheckUtils]: 24: Hoare triple {6770#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6770#false} is VALID [2022-04-27 11:15:23,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {6770#false} ~cond := #in~cond; {6770#false} is VALID [2022-04-27 11:15:23,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {6770#false} assume 0 == ~cond; {6770#false} is VALID [2022-04-27 11:15:23,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {6770#false} assume !false; {6770#false} is VALID [2022-04-27 11:15:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:15:23,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:23,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {6770#false} assume !false; {6770#false} is VALID [2022-04-27 11:15:23,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {6770#false} assume 0 == ~cond; {6770#false} is VALID [2022-04-27 11:15:23,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {6770#false} ~cond := #in~cond; {6770#false} is VALID [2022-04-27 11:15:23,427 INFO L272 TraceCheckUtils]: 24: Hoare triple {6770#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6770#false} is VALID [2022-04-27 11:15:23,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {6879#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6770#false} is VALID [2022-04-27 11:15:23,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {6883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {6879#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:15:23,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {6883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:23,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {6883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:23,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {6879#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:23,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {6896#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6879#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:15:23,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {6896#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6896#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:15:23,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {6769#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6896#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:15:23,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {6769#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6769#true} is VALID [2022-04-27 11:15:23,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {6769#true} assume !(~z~0 % 4294967296 > 0); {6769#true} is VALID [2022-04-27 11:15:23,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {6769#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6769#true} is VALID [2022-04-27 11:15:23,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {6769#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6769#true} is VALID [2022-04-27 11:15:23,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {6769#true} ~z~0 := ~y~0; {6769#true} is VALID [2022-04-27 11:15:23,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {6769#true} assume !(~x~0 % 4294967296 > 0); {6769#true} is VALID [2022-04-27 11:15:23,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {6769#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6769#true} is VALID [2022-04-27 11:15:23,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {6769#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6769#true} is VALID [2022-04-27 11:15:23,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {6769#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6769#true} is VALID [2022-04-27 11:15:23,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {6769#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6769#true} is VALID [2022-04-27 11:15:23,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {6769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6769#true} is VALID [2022-04-27 11:15:23,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {6769#true} call #t~ret17 := main(); {6769#true} is VALID [2022-04-27 11:15:23,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6769#true} {6769#true} #94#return; {6769#true} is VALID [2022-04-27 11:15:23,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {6769#true} assume true; {6769#true} is VALID [2022-04-27 11:15:23,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {6769#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(10, 2);call #Ultimate.allocInit(12, 3); {6769#true} is VALID [2022-04-27 11:15:23,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {6769#true} call ULTIMATE.init(); {6769#true} is VALID [2022-04-27 11:15:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 11:15:23,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097081766] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:23,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:23,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 5] total 14 [2022-04-27 11:15:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660161857] [2022-04-27 11:15:23,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:23,435 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 11:15:23,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:23,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:23,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:23,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:15:23,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:23,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:15:23,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:15:23,470 INFO L87 Difference]: Start difference. First operand 111 states and 146 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:24,533 INFO L93 Difference]: Finished difference Result 294 states and 436 transitions. [2022-04-27 11:15:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 11:15:24,534 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 11:15:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 146 transitions. [2022-04-27 11:15:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 146 transitions. [2022-04-27 11:15:24,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 146 transitions. [2022-04-27 11:15:24,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:24,675 INFO L225 Difference]: With dead ends: 294 [2022-04-27 11:15:24,675 INFO L226 Difference]: Without dead ends: 244 [2022-04-27 11:15:24,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:15:24,676 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 116 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:24,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 70 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:15:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-04-27 11:15:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 175. [2022-04-27 11:15:24,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:24,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 175 states, 170 states have (on average 1.4) internal successors, (238), 170 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:24,788 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 175 states, 170 states have (on average 1.4) internal successors, (238), 170 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:24,788 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 175 states, 170 states have (on average 1.4) internal successors, (238), 170 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:24,792 INFO L93 Difference]: Finished difference Result 244 states and 334 transitions. [2022-04-27 11:15:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 334 transitions. [2022-04-27 11:15:24,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:24,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:24,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 170 states have (on average 1.4) internal successors, (238), 170 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 244 states. [2022-04-27 11:15:24,793 INFO L87 Difference]: Start difference. First operand has 175 states, 170 states have (on average 1.4) internal successors, (238), 170 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 244 states. [2022-04-27 11:15:24,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:24,797 INFO L93 Difference]: Finished difference Result 244 states and 334 transitions. [2022-04-27 11:15:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 334 transitions. [2022-04-27 11:15:24,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:24,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:24,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:24,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.4) internal successors, (238), 170 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 242 transitions. [2022-04-27 11:15:24,799 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 242 transitions. Word has length 28 [2022-04-27 11:15:24,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:24,800 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 242 transitions. [2022-04-27 11:15:24,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 242 transitions. [2022-04-27 11:15:24,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 11:15:24,801 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:24,801 INFO L195 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:24,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 11:15:25,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-27 11:15:25,015 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:25,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:25,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1700492953, now seen corresponding path program 1 times [2022-04-27 11:15:25,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:25,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801749157] [2022-04-27 11:15:25,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:25,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:25,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:25,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {8049#(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(10, 2);call #Ultimate.allocInit(12, 3); {8035#true} is VALID [2022-04-27 11:15:25,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-27 11:15:25,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8035#true} {8035#true} #94#return; {8035#true} is VALID [2022-04-27 11:15:25,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {8035#true} call ULTIMATE.init(); {8049#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:25,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {8049#(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(10, 2);call #Ultimate.allocInit(12, 3); {8035#true} is VALID [2022-04-27 11:15:25,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-27 11:15:25,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8035#true} {8035#true} #94#return; {8035#true} is VALID [2022-04-27 11:15:25,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {8035#true} call #t~ret17 := main(); {8035#true} is VALID [2022-04-27 11:15:25,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {8035#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8040#(= main_~y~0 0)} is VALID [2022-04-27 11:15:25,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {8040#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8041#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:25,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {8041#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8042#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:25,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {8042#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8043#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:25,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {8043#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8044#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:25,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {8044#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8045#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:25,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {8045#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {8045#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:25,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {8045#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {8046#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:15:25,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {8046#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8047#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:15:25,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {8047#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8048#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:15:25,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {8048#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {8036#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {8036#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {8036#false} assume !(~y~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {8036#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {8036#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {8036#false} assume !(~x~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {8036#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {8036#false} assume !(~z~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {8036#false} assume !(~y~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L272 TraceCheckUtils]: 25: Hoare triple {8036#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {8036#false} ~cond := #in~cond; {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {8036#false} assume 0 == ~cond; {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {8036#false} assume !false; {8036#false} is VALID [2022-04-27 11:15:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:15:25,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:25,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801749157] [2022-04-27 11:15:25,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801749157] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:25,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609808261] [2022-04-27 11:15:25,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:25,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:25,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:25,160 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:15:25,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 11:15:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:25,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 11:15:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:25,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:25,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {8035#true} call ULTIMATE.init(); {8035#true} is VALID [2022-04-27 11:15:25,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {8035#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(10, 2);call #Ultimate.allocInit(12, 3); {8035#true} is VALID [2022-04-27 11:15:25,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-27 11:15:25,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8035#true} {8035#true} #94#return; {8035#true} is VALID [2022-04-27 11:15:25,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {8035#true} call #t~ret17 := main(); {8035#true} is VALID [2022-04-27 11:15:25,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {8035#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8040#(= main_~y~0 0)} is VALID [2022-04-27 11:15:25,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {8040#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8041#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:25,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {8041#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8042#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:25,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {8042#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8043#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:25,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {8043#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8044#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:25,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {8044#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8045#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:25,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {8045#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {8045#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:25,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {8045#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {8046#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:15:25,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {8046#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8047#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:15:25,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {8047#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8095#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:25,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {8095#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {8036#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8036#false} is VALID [2022-04-27 11:15:25,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {8036#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8036#false} is VALID [2022-04-27 11:15:25,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {8036#false} assume !(~y~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {8036#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8036#false} is VALID [2022-04-27 11:15:25,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {8036#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8036#false} is VALID [2022-04-27 11:15:25,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {8036#false} assume !(~x~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {8036#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8036#false} is VALID [2022-04-27 11:15:25,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {8036#false} assume !(~z~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {8036#false} assume !(~y~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,387 INFO L272 TraceCheckUtils]: 25: Hoare triple {8036#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8036#false} is VALID [2022-04-27 11:15:25,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {8036#false} ~cond := #in~cond; {8036#false} is VALID [2022-04-27 11:15:25,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {8036#false} assume 0 == ~cond; {8036#false} is VALID [2022-04-27 11:15:25,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {8036#false} assume !false; {8036#false} is VALID [2022-04-27 11:15:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:15:25,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:25,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {8036#false} assume !false; {8036#false} is VALID [2022-04-27 11:15:25,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {8036#false} assume 0 == ~cond; {8036#false} is VALID [2022-04-27 11:15:25,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {8036#false} ~cond := #in~cond; {8036#false} is VALID [2022-04-27 11:15:25,569 INFO L272 TraceCheckUtils]: 25: Hoare triple {8036#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8036#false} is VALID [2022-04-27 11:15:25,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {8036#false} assume !(~y~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {8036#false} assume !(~z~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {8036#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8036#false} is VALID [2022-04-27 11:15:25,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {8036#false} assume !(~x~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {8036#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8036#false} is VALID [2022-04-27 11:15:25,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {8036#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8036#false} is VALID [2022-04-27 11:15:25,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {8036#false} assume !(~y~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {8036#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8036#false} is VALID [2022-04-27 11:15:25,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {8036#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8036#false} is VALID [2022-04-27 11:15:25,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {8177#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8036#false} is VALID [2022-04-27 11:15:25,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {8181#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8177#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:15:25,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {8185#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8181#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:25,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {8189#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {8185#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:15:25,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {8189#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {8189#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:15:25,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {8196#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8189#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:15:25,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {8200#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8196#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:25,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {8204#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8200#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:15:25,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {8208#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8204#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:15:25,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {8212#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8208#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:15:25,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {8035#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8212#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:15:25,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {8035#true} call #t~ret17 := main(); {8035#true} is VALID [2022-04-27 11:15:25,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8035#true} {8035#true} #94#return; {8035#true} is VALID [2022-04-27 11:15:25,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-27 11:15:25,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {8035#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(10, 2);call #Ultimate.allocInit(12, 3); {8035#true} is VALID [2022-04-27 11:15:25,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {8035#true} call ULTIMATE.init(); {8035#true} is VALID [2022-04-27 11:15:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:15:25,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609808261] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:25,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:25,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-27 11:15:25,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22794034] [2022-04-27 11:15:25,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:25,576 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:15:25,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:25,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:25,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:25,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 11:15:25,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:25,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 11:15:25,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:15:25,604 INFO L87 Difference]: Start difference. First operand 175 states and 242 transitions. Second operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:33,760 INFO L93 Difference]: Finished difference Result 517 states and 800 transitions. [2022-04-27 11:15:33,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-04-27 11:15:33,760 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:15:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 316 transitions. [2022-04-27 11:15:33,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 316 transitions. [2022-04-27 11:15:33,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 316 transitions. [2022-04-27 11:15:34,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:34,408 INFO L225 Difference]: With dead ends: 517 [2022-04-27 11:15:34,409 INFO L226 Difference]: Without dead ends: 428 [2022-04-27 11:15:34,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4991 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2648, Invalid=11158, Unknown=0, NotChecked=0, Total=13806 [2022-04-27 11:15:34,412 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 366 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:34,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 105 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 11:15:34,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-04-27 11:15:34,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 232. [2022-04-27 11:15:34,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:34,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand has 232 states, 227 states have (on average 1.4273127753303965) internal successors, (324), 227 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:34,591 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand has 232 states, 227 states have (on average 1.4273127753303965) internal successors, (324), 227 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:34,591 INFO L87 Difference]: Start difference. First operand 428 states. Second operand has 232 states, 227 states have (on average 1.4273127753303965) internal successors, (324), 227 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:34,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:34,599 INFO L93 Difference]: Finished difference Result 428 states and 601 transitions. [2022-04-27 11:15:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 601 transitions. [2022-04-27 11:15:34,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:34,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:34,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 232 states, 227 states have (on average 1.4273127753303965) internal successors, (324), 227 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 428 states. [2022-04-27 11:15:34,600 INFO L87 Difference]: Start difference. First operand has 232 states, 227 states have (on average 1.4273127753303965) internal successors, (324), 227 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 428 states. [2022-04-27 11:15:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:34,608 INFO L93 Difference]: Finished difference Result 428 states and 601 transitions. [2022-04-27 11:15:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 601 transitions. [2022-04-27 11:15:34,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:34,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:34,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:34,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 1.4273127753303965) internal successors, (324), 227 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 328 transitions. [2022-04-27 11:15:34,612 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 328 transitions. Word has length 29 [2022-04-27 11:15:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:34,612 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 328 transitions. [2022-04-27 11:15:34,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 328 transitions. [2022-04-27 11:15:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 11:15:34,613 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:34,613 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:34,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 11:15:34,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 11:15:34,819 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:34,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:34,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1141944188, now seen corresponding path program 4 times [2022-04-27 11:15:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:34,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695002904] [2022-04-27 11:15:34,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:34,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:34,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {10167#(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(10, 2);call #Ultimate.allocInit(12, 3); {10151#true} is VALID [2022-04-27 11:15:34,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {10151#true} assume true; {10151#true} is VALID [2022-04-27 11:15:34,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10151#true} {10151#true} #94#return; {10151#true} is VALID [2022-04-27 11:15:34,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {10151#true} call ULTIMATE.init(); {10167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:34,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {10167#(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(10, 2);call #Ultimate.allocInit(12, 3); {10151#true} is VALID [2022-04-27 11:15:34,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {10151#true} assume true; {10151#true} is VALID [2022-04-27 11:15:34,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10151#true} {10151#true} #94#return; {10151#true} is VALID [2022-04-27 11:15:34,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {10151#true} call #t~ret17 := main(); {10151#true} is VALID [2022-04-27 11:15:34,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {10151#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10156#(= main_~y~0 0)} is VALID [2022-04-27 11:15:34,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {10156#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10157#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:34,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {10157#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10158#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:34,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {10158#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10159#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:34,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {10159#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10160#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:34,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {10160#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {10160#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:34,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {10160#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {10161#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:15:34,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {10161#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10162#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:34,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {10162#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10163#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:34,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {10163#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10164#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:34,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {10164#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10165#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:34,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {10165#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {10165#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:34,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {10165#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10164#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:34,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {10164#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10163#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:34,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {10163#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10162#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:34,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {10162#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10161#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:15:34,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {10161#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {10161#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:15:34,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {10161#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~x~0 % 4294967296 > 0); {10161#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:15:34,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {10161#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10166#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:15:34,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {10166#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {10152#false} is VALID [2022-04-27 11:15:34,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {10152#false} assume !(~y~0 % 4294967296 > 0); {10152#false} is VALID [2022-04-27 11:15:34,999 INFO L272 TraceCheckUtils]: 26: Hoare triple {10152#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10152#false} is VALID [2022-04-27 11:15:34,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {10152#false} ~cond := #in~cond; {10152#false} is VALID [2022-04-27 11:15:34,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {10152#false} assume 0 == ~cond; {10152#false} is VALID [2022-04-27 11:15:34,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {10152#false} assume !false; {10152#false} is VALID [2022-04-27 11:15:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:34,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:34,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695002904] [2022-04-27 11:15:34,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695002904] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:34,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082218694] [2022-04-27 11:15:34,999 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:15:34,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:35,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:35,000 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:15:35,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 11:15:35,036 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:15:35,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:35,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 11:15:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:35,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:35,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {10151#true} call ULTIMATE.init(); {10151#true} is VALID [2022-04-27 11:15:35,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {10151#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(10, 2);call #Ultimate.allocInit(12, 3); {10151#true} is VALID [2022-04-27 11:15:35,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {10151#true} assume true; {10151#true} is VALID [2022-04-27 11:15:35,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10151#true} {10151#true} #94#return; {10151#true} is VALID [2022-04-27 11:15:35,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {10151#true} call #t~ret17 := main(); {10151#true} is VALID [2022-04-27 11:15:35,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {10151#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10151#true} is VALID [2022-04-27 11:15:35,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {10151#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10189#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:35,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {10189#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10193#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:35,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {10193#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10197#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:35,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {10197#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10201#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:35,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {10201#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10201#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:35,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {10201#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {10201#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:35,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {10201#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10197#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:35,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {10197#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10193#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:35,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {10193#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10189#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:35,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {10189#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {10152#false} is VALID [2022-04-27 11:15:35,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {10152#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10152#false} is VALID [2022-04-27 11:15:35,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {10152#false} assume !(~z~0 % 4294967296 > 0); {10152#false} is VALID [2022-04-27 11:15:35,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {10152#false} assume !(~y~0 % 4294967296 > 0); {10152#false} is VALID [2022-04-27 11:15:35,197 INFO L272 TraceCheckUtils]: 26: Hoare triple {10152#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10152#false} is VALID [2022-04-27 11:15:35,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {10152#false} ~cond := #in~cond; {10152#false} is VALID [2022-04-27 11:15:35,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {10152#false} assume 0 == ~cond; {10152#false} is VALID [2022-04-27 11:15:35,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {10152#false} assume !false; {10152#false} is VALID [2022-04-27 11:15:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 11:15:35,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:35,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {10152#false} assume !false; {10152#false} is VALID [2022-04-27 11:15:35,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {10152#false} assume 0 == ~cond; {10152#false} is VALID [2022-04-27 11:15:35,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {10152#false} ~cond := #in~cond; {10152#false} is VALID [2022-04-27 11:15:35,286 INFO L272 TraceCheckUtils]: 26: Hoare triple {10152#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10152#false} is VALID [2022-04-27 11:15:35,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {10152#false} assume !(~y~0 % 4294967296 > 0); {10152#false} is VALID [2022-04-27 11:15:35,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {10152#false} assume !(~z~0 % 4294967296 > 0); {10152#false} is VALID [2022-04-27 11:15:35,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {10152#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10152#false} is VALID [2022-04-27 11:15:35,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {10152#false} is VALID [2022-04-27 11:15:35,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {10220#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {10189#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10220#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:35,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {10193#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10189#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:35,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {10197#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10193#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:35,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {10201#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10197#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:35,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {10201#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {10201#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:35,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {10201#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10201#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:35,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {10197#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10201#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:35,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {10193#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10197#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:35,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {10189#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10193#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:35,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {10151#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10189#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:35,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {10151#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10151#true} is VALID [2022-04-27 11:15:35,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {10151#true} call #t~ret17 := main(); {10151#true} is VALID [2022-04-27 11:15:35,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10151#true} {10151#true} #94#return; {10151#true} is VALID [2022-04-27 11:15:35,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {10151#true} assume true; {10151#true} is VALID [2022-04-27 11:15:35,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {10151#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(10, 2);call #Ultimate.allocInit(12, 3); {10151#true} is VALID [2022-04-27 11:15:35,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {10151#true} call ULTIMATE.init(); {10151#true} is VALID [2022-04-27 11:15:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 11:15:35,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082218694] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:35,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:35,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-27 11:15:35,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065515209] [2022-04-27 11:15:35,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:35,295 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 11:15:35,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:35,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:35,326 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:15:35,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:15:35,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:35,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:15:35,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:15:35,326 INFO L87 Difference]: Start difference. First operand 232 states and 328 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:42,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:42,533 INFO L93 Difference]: Finished difference Result 613 states and 894 transitions. [2022-04-27 11:15:42,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-04-27 11:15:42,533 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 11:15:42,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 300 transitions. [2022-04-27 11:15:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 300 transitions. [2022-04-27 11:15:42,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 300 transitions. [2022-04-27 11:15:42,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:42,958 INFO L225 Difference]: With dead ends: 613 [2022-04-27 11:15:42,958 INFO L226 Difference]: Without dead ends: 551 [2022-04-27 11:15:42,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5297 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1425, Invalid=13337, Unknown=0, NotChecked=0, Total=14762 [2022-04-27 11:15:42,961 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 224 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:42,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 96 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 11:15:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-04-27 11:15:43,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 262. [2022-04-27 11:15:43,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:43,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 551 states. Second operand has 262 states, 257 states have (on average 1.4319066147859922) internal successors, (368), 257 states have internal predecessors, (368), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:43,160 INFO L74 IsIncluded]: Start isIncluded. First operand 551 states. Second operand has 262 states, 257 states have (on average 1.4319066147859922) internal successors, (368), 257 states have internal predecessors, (368), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:43,160 INFO L87 Difference]: Start difference. First operand 551 states. Second operand has 262 states, 257 states have (on average 1.4319066147859922) internal successors, (368), 257 states have internal predecessors, (368), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:43,171 INFO L93 Difference]: Finished difference Result 551 states and 748 transitions. [2022-04-27 11:15:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 748 transitions. [2022-04-27 11:15:43,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:43,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:43,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 262 states, 257 states have (on average 1.4319066147859922) internal successors, (368), 257 states have internal predecessors, (368), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 551 states. [2022-04-27 11:15:43,172 INFO L87 Difference]: Start difference. First operand has 262 states, 257 states have (on average 1.4319066147859922) internal successors, (368), 257 states have internal predecessors, (368), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 551 states. [2022-04-27 11:15:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:43,184 INFO L93 Difference]: Finished difference Result 551 states and 748 transitions. [2022-04-27 11:15:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 748 transitions. [2022-04-27 11:15:43,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:43,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:43,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:43,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 257 states have (on average 1.4319066147859922) internal successors, (368), 257 states have internal predecessors, (368), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 372 transitions. [2022-04-27 11:15:43,188 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 372 transitions. Word has length 30 [2022-04-27 11:15:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:43,189 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 372 transitions. [2022-04-27 11:15:43,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 372 transitions. [2022-04-27 11:15:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:15:43,189 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:43,189 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:43,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 11:15:43,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 11:15:43,402 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:43,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash -379865510, now seen corresponding path program 2 times [2022-04-27 11:15:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:43,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559589291] [2022-04-27 11:15:43,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:43,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:43,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:43,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {12684#(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(10, 2);call #Ultimate.allocInit(12, 3); {12672#true} is VALID [2022-04-27 11:15:43,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {12672#true} assume true; {12672#true} is VALID [2022-04-27 11:15:43,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12672#true} {12672#true} #94#return; {12672#true} is VALID [2022-04-27 11:15:43,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {12672#true} call ULTIMATE.init(); {12684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:43,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {12684#(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(10, 2);call #Ultimate.allocInit(12, 3); {12672#true} is VALID [2022-04-27 11:15:43,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {12672#true} assume true; {12672#true} is VALID [2022-04-27 11:15:43,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12672#true} {12672#true} #94#return; {12672#true} is VALID [2022-04-27 11:15:43,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {12672#true} call #t~ret17 := main(); {12672#true} is VALID [2022-04-27 11:15:43,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {12672#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12672#true} is VALID [2022-04-27 11:15:43,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {12672#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12677#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:43,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {12677#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12678#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-27 11:15:43,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {12678#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12679#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:15:43,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {12679#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {12679#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:15:43,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {12679#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {12679#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:15:43,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {12679#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12680#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:15:43,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {12680#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12681#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:15:43,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {12681#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12682#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:43,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {12682#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {12682#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:43,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {12682#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12682#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:43,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {12682#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12682#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:43,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {12682#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12682#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:43,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {12682#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {12682#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:43,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {12682#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12683#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:43,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {12683#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {12673#false} is VALID [2022-04-27 11:15:43,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {12673#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12673#false} is VALID [2022-04-27 11:15:43,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {12673#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12673#false} is VALID [2022-04-27 11:15:43,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {12673#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12673#false} is VALID [2022-04-27 11:15:43,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {12673#false} assume !(~z~0 % 4294967296 > 0); {12673#false} is VALID [2022-04-27 11:15:43,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {12673#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {12673#false} is VALID [2022-04-27 11:15:43,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {12673#false} assume !(~y~0 % 4294967296 > 0); {12673#false} is VALID [2022-04-27 11:15:43,528 INFO L272 TraceCheckUtils]: 27: Hoare triple {12673#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12673#false} is VALID [2022-04-27 11:15:43,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {12673#false} ~cond := #in~cond; {12673#false} is VALID [2022-04-27 11:15:43,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {12673#false} assume 0 == ~cond; {12673#false} is VALID [2022-04-27 11:15:43,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {12673#false} assume !false; {12673#false} is VALID [2022-04-27 11:15:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 11:15:43,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:43,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559589291] [2022-04-27 11:15:43,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559589291] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:43,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697598070] [2022-04-27 11:15:43,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:15:43,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:43,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:43,530 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:15:43,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 11:15:43,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:15:43,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:43,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 11:15:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:43,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:43,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {12672#true} call ULTIMATE.init(); {12672#true} is VALID [2022-04-27 11:15:43,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {12672#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(10, 2);call #Ultimate.allocInit(12, 3); {12672#true} is VALID [2022-04-27 11:15:43,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {12672#true} assume true; {12672#true} is VALID [2022-04-27 11:15:43,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12672#true} {12672#true} #94#return; {12672#true} is VALID [2022-04-27 11:15:43,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {12672#true} call #t~ret17 := main(); {12672#true} is VALID [2022-04-27 11:15:43,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {12672#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12672#true} is VALID [2022-04-27 11:15:43,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {12672#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12672#true} is VALID [2022-04-27 11:15:43,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {12672#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12677#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:43,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {12677#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12712#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:43,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {12712#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {12712#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:43,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {12712#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {12712#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:43,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {12712#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12677#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:43,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {12677#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12725#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {12725#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12725#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {12725#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {12673#false} is VALID [2022-04-27 11:15:43,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {12673#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12673#false} is VALID [2022-04-27 11:15:43,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {12673#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12673#false} is VALID [2022-04-27 11:15:43,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {12673#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12673#false} is VALID [2022-04-27 11:15:43,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {12673#false} assume !(~z~0 % 4294967296 > 0); {12673#false} is VALID [2022-04-27 11:15:43,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {12673#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {12673#false} is VALID [2022-04-27 11:15:43,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {12673#false} assume !(~y~0 % 4294967296 > 0); {12673#false} is VALID [2022-04-27 11:15:43,852 INFO L272 TraceCheckUtils]: 27: Hoare triple {12673#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12673#false} is VALID [2022-04-27 11:15:43,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {12673#false} ~cond := #in~cond; {12673#false} is VALID [2022-04-27 11:15:43,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {12673#false} assume 0 == ~cond; {12673#false} is VALID [2022-04-27 11:15:43,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {12673#false} assume !false; {12673#false} is VALID [2022-04-27 11:15:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 11:15:43,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:43,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {12673#false} assume !false; {12673#false} is VALID [2022-04-27 11:15:43,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {12673#false} assume 0 == ~cond; {12673#false} is VALID [2022-04-27 11:15:43,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {12673#false} ~cond := #in~cond; {12673#false} is VALID [2022-04-27 11:15:43,941 INFO L272 TraceCheckUtils]: 27: Hoare triple {12673#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12673#false} is VALID [2022-04-27 11:15:43,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {12673#false} assume !(~y~0 % 4294967296 > 0); {12673#false} is VALID [2022-04-27 11:15:43,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {12673#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {12673#false} is VALID [2022-04-27 11:15:43,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {12673#false} assume !(~z~0 % 4294967296 > 0); {12673#false} is VALID [2022-04-27 11:15:43,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {12673#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12673#false} is VALID [2022-04-27 11:15:43,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {12673#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12673#false} is VALID [2022-04-27 11:15:43,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {12673#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12673#false} is VALID [2022-04-27 11:15:43,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {12725#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {12673#false} is VALID [2022-04-27 11:15:43,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12725#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {12725#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12729#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {12677#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12725#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:43,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {12712#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12677#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:43,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {12712#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {12712#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:43,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {12712#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {12712#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:43,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {12677#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12712#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:43,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {12672#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12677#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:43,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {12672#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12672#true} is VALID [2022-04-27 11:15:43,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {12672#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12672#true} is VALID [2022-04-27 11:15:43,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {12672#true} call #t~ret17 := main(); {12672#true} is VALID [2022-04-27 11:15:43,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12672#true} {12672#true} #94#return; {12672#true} is VALID [2022-04-27 11:15:43,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {12672#true} assume true; {12672#true} is VALID [2022-04-27 11:15:43,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {12672#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(10, 2);call #Ultimate.allocInit(12, 3); {12672#true} is VALID [2022-04-27 11:15:43,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {12672#true} call ULTIMATE.init(); {12672#true} is VALID [2022-04-27 11:15:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 11:15:43,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697598070] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:43,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:43,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 13 [2022-04-27 11:15:43,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222425011] [2022-04-27 11:15:43,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:43,952 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 11:15:43,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:43,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:43,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:43,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:15:43,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:43,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:15:43,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:15:43,979 INFO L87 Difference]: Start difference. First operand 262 states and 372 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:44,914 INFO L93 Difference]: Finished difference Result 478 states and 664 transitions. [2022-04-27 11:15:44,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 11:15:44,914 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 11:15:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 103 transitions. [2022-04-27 11:15:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 103 transitions. [2022-04-27 11:15:44,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 103 transitions. [2022-04-27 11:15:45,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:45,036 INFO L225 Difference]: With dead ends: 478 [2022-04-27 11:15:45,036 INFO L226 Difference]: Without dead ends: 445 [2022-04-27 11:15:45,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:15:45,037 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 91 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:45,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 54 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:15:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-04-27 11:15:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 273. [2022-04-27 11:15:45,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:45,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 445 states. Second operand has 273 states, 268 states have (on average 1.414179104477612) internal successors, (379), 268 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:45,289 INFO L74 IsIncluded]: Start isIncluded. First operand 445 states. Second operand has 273 states, 268 states have (on average 1.414179104477612) internal successors, (379), 268 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:45,289 INFO L87 Difference]: Start difference. First operand 445 states. Second operand has 273 states, 268 states have (on average 1.414179104477612) internal successors, (379), 268 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:45,297 INFO L93 Difference]: Finished difference Result 445 states and 615 transitions. [2022-04-27 11:15:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 615 transitions. [2022-04-27 11:15:45,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:45,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:45,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.414179104477612) internal successors, (379), 268 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 445 states. [2022-04-27 11:15:45,298 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.414179104477612) internal successors, (379), 268 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 445 states. [2022-04-27 11:15:45,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:45,305 INFO L93 Difference]: Finished difference Result 445 states and 615 transitions. [2022-04-27 11:15:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 615 transitions. [2022-04-27 11:15:45,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:45,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:45,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:45,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.414179104477612) internal successors, (379), 268 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 383 transitions. [2022-04-27 11:15:45,311 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 383 transitions. Word has length 31 [2022-04-27 11:15:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:45,311 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 383 transitions. [2022-04-27 11:15:45,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 383 transitions. [2022-04-27 11:15:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:15:45,311 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:45,311 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:45,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 11:15:45,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 11:15:45,527 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:45,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1142429803, now seen corresponding path program 5 times [2022-04-27 11:15:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:45,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761374831] [2022-04-27 11:15:45,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:45,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:45,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:45,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {14674#(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(10, 2);call #Ultimate.allocInit(12, 3); {14656#true} is VALID [2022-04-27 11:15:45,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {14656#true} assume true; {14656#true} is VALID [2022-04-27 11:15:45,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14656#true} {14656#true} #94#return; {14656#true} is VALID [2022-04-27 11:15:45,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {14656#true} call ULTIMATE.init(); {14674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:45,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {14674#(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(10, 2);call #Ultimate.allocInit(12, 3); {14656#true} is VALID [2022-04-27 11:15:45,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {14656#true} assume true; {14656#true} is VALID [2022-04-27 11:15:45,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14656#true} {14656#true} #94#return; {14656#true} is VALID [2022-04-27 11:15:45,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {14656#true} call #t~ret17 := main(); {14656#true} is VALID [2022-04-27 11:15:45,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {14656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14661#(= main_~y~0 0)} is VALID [2022-04-27 11:15:45,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {14661#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:45,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {14662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:45,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {14663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:45,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {14664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:45,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {14665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:45,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {14666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:45,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:45,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {14668#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:15:45,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {14668#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14669#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:15:45,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {14669#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14670#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:15:45,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {14670#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14671#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:45,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {14671#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14672#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:45,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {14672#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14673#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:45,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {14673#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14657#false} is VALID [2022-04-27 11:15:45,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {14657#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14657#false} is VALID [2022-04-27 11:15:45,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {14657#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14657#false} is VALID [2022-04-27 11:15:45,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {14657#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14657#false} is VALID [2022-04-27 11:15:45,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {14657#false} assume !(~y~0 % 4294967296 > 0); {14657#false} is VALID [2022-04-27 11:15:45,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {14657#false} assume !(~x~0 % 4294967296 > 0); {14657#false} is VALID [2022-04-27 11:15:45,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {14657#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14657#false} is VALID [2022-04-27 11:15:45,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {14657#false} assume !(~z~0 % 4294967296 > 0); {14657#false} is VALID [2022-04-27 11:15:45,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {14657#false} assume !(~y~0 % 4294967296 > 0); {14657#false} is VALID [2022-04-27 11:15:45,744 INFO L272 TraceCheckUtils]: 28: Hoare triple {14657#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14657#false} is VALID [2022-04-27 11:15:45,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {14657#false} ~cond := #in~cond; {14657#false} is VALID [2022-04-27 11:15:45,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {14657#false} assume 0 == ~cond; {14657#false} is VALID [2022-04-27 11:15:45,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {14657#false} assume !false; {14657#false} is VALID [2022-04-27 11:15:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:15:45,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:45,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761374831] [2022-04-27 11:15:45,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761374831] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:45,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483218758] [2022-04-27 11:15:45,744 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:15:45,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:45,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:45,745 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:15:45,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 11:15:45,889 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:15:45,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:45,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 11:15:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:45,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:46,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {14656#true} call ULTIMATE.init(); {14656#true} is VALID [2022-04-27 11:15:46,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {14656#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(10, 2);call #Ultimate.allocInit(12, 3); {14656#true} is VALID [2022-04-27 11:15:46,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {14656#true} assume true; {14656#true} is VALID [2022-04-27 11:15:46,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14656#true} {14656#true} #94#return; {14656#true} is VALID [2022-04-27 11:15:46,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {14656#true} call #t~ret17 := main(); {14656#true} is VALID [2022-04-27 11:15:46,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {14656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14661#(= main_~y~0 0)} is VALID [2022-04-27 11:15:46,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {14661#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:46,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {14662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:46,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {14663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:46,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {14664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:46,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {14665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:46,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {14666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:46,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:46,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {14717#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:46,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {14717#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14721#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:15:46,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {14721#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14725#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:46,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {14725#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14729#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:46,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {14729#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:46,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:46,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:46,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {14667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:46,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {14666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:46,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {14665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:46,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {14664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~y~0 % 4294967296 > 0); {14657#false} is VALID [2022-04-27 11:15:46,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {14657#false} assume !(~x~0 % 4294967296 > 0); {14657#false} is VALID [2022-04-27 11:15:46,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {14657#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14657#false} is VALID [2022-04-27 11:15:46,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {14657#false} assume !(~z~0 % 4294967296 > 0); {14657#false} is VALID [2022-04-27 11:15:46,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {14657#false} assume !(~y~0 % 4294967296 > 0); {14657#false} is VALID [2022-04-27 11:15:46,196 INFO L272 TraceCheckUtils]: 28: Hoare triple {14657#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14657#false} is VALID [2022-04-27 11:15:46,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {14657#false} ~cond := #in~cond; {14657#false} is VALID [2022-04-27 11:15:46,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {14657#false} assume 0 == ~cond; {14657#false} is VALID [2022-04-27 11:15:46,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {14657#false} assume !false; {14657#false} is VALID [2022-04-27 11:15:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:46,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:46,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {14657#false} assume !false; {14657#false} is VALID [2022-04-27 11:15:46,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {14657#false} assume 0 == ~cond; {14657#false} is VALID [2022-04-27 11:15:46,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {14657#false} ~cond := #in~cond; {14657#false} is VALID [2022-04-27 11:15:46,405 INFO L272 TraceCheckUtils]: 28: Hoare triple {14657#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14657#false} is VALID [2022-04-27 11:15:46,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {14657#false} assume !(~y~0 % 4294967296 > 0); {14657#false} is VALID [2022-04-27 11:15:46,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {14657#false} assume !(~z~0 % 4294967296 > 0); {14657#false} is VALID [2022-04-27 11:15:46,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {14657#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14657#false} is VALID [2022-04-27 11:15:46,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {14657#false} assume !(~x~0 % 4294967296 > 0); {14657#false} is VALID [2022-04-27 11:15:46,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {14799#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {14657#false} is VALID [2022-04-27 11:15:46,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {14803#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14799#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:15:46,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {14807#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14803#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:46,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {14811#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14807#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:15:46,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {14811#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {14811#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:15:46,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {14811#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14811#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:15:46,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {14821#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14811#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:15:46,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {14825#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14821#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:15:46,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {14829#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14825#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:15:46,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {14833#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14829#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:15:46,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {14656#true} ~z~0 := ~y~0; {14833#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:15:46,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {14656#true} assume !(~x~0 % 4294967296 > 0); {14656#true} is VALID [2022-04-27 11:15:46,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {14656#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14656#true} is VALID [2022-04-27 11:15:46,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {14656#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14656#true} is VALID [2022-04-27 11:15:46,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {14656#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14656#true} is VALID [2022-04-27 11:15:46,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {14656#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14656#true} is VALID [2022-04-27 11:15:46,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {14656#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14656#true} is VALID [2022-04-27 11:15:46,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {14656#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14656#true} is VALID [2022-04-27 11:15:46,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {14656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14656#true} is VALID [2022-04-27 11:15:46,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {14656#true} call #t~ret17 := main(); {14656#true} is VALID [2022-04-27 11:15:46,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14656#true} {14656#true} #94#return; {14656#true} is VALID [2022-04-27 11:15:46,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {14656#true} assume true; {14656#true} is VALID [2022-04-27 11:15:46,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {14656#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(10, 2);call #Ultimate.allocInit(12, 3); {14656#true} is VALID [2022-04-27 11:15:46,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {14656#true} call ULTIMATE.init(); {14656#true} is VALID [2022-04-27 11:15:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-27 11:15:46,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483218758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:46,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:46,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 10] total 28 [2022-04-27 11:15:46,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828400743] [2022-04-27 11:15:46,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:46,412 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 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:15:46,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:46,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:46,447 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:15:46,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 11:15:46,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:46,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 11:15:46,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:15:46,448 INFO L87 Difference]: Start difference. First operand 273 states and 383 transitions. Second operand has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:49,238 INFO L93 Difference]: Finished difference Result 543 states and 797 transitions. [2022-04-27 11:15:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-27 11:15:49,238 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 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:15:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 210 transitions. [2022-04-27 11:15:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 210 transitions. [2022-04-27 11:15:49,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 210 transitions. [2022-04-27 11:15:49,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:49,484 INFO L225 Difference]: With dead ends: 543 [2022-04-27 11:15:49,484 INFO L226 Difference]: Without dead ends: 479 [2022-04-27 11:15:49,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=3610, Unknown=0, NotChecked=0, Total=4556 [2022-04-27 11:15:49,486 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 302 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:49,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 105 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 11:15:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-04-27 11:15:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 333. [2022-04-27 11:15:49,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:49,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 479 states. Second operand has 333 states, 328 states have (on average 1.4359756097560976) internal successors, (471), 328 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:49,773 INFO L74 IsIncluded]: Start isIncluded. First operand 479 states. Second operand has 333 states, 328 states have (on average 1.4359756097560976) internal successors, (471), 328 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:49,773 INFO L87 Difference]: Start difference. First operand 479 states. Second operand has 333 states, 328 states have (on average 1.4359756097560976) internal successors, (471), 328 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:49,781 INFO L93 Difference]: Finished difference Result 479 states and 670 transitions. [2022-04-27 11:15:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 670 transitions. [2022-04-27 11:15:49,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:49,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:49,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.4359756097560976) internal successors, (471), 328 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 479 states. [2022-04-27 11:15:49,782 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.4359756097560976) internal successors, (471), 328 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 479 states. [2022-04-27 11:15:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:49,790 INFO L93 Difference]: Finished difference Result 479 states and 670 transitions. [2022-04-27 11:15:49,790 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 670 transitions. [2022-04-27 11:15:49,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:49,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:49,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:49,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.4359756097560976) internal successors, (471), 328 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 475 transitions. [2022-04-27 11:15:49,795 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 475 transitions. Word has length 32 [2022-04-27 11:15:49,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:49,795 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 475 transitions. [2022-04-27 11:15:49,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 475 transitions. [2022-04-27 11:15:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 11:15:49,796 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:49,796 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:49,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 11:15:50,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:50,000 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:50,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:50,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2118455400, now seen corresponding path program 6 times [2022-04-27 11:15:50,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:50,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357815997] [2022-04-27 11:15:50,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:50,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:50,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:50,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {16960#(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(10, 2);call #Ultimate.allocInit(12, 3); {16942#true} is VALID [2022-04-27 11:15:50,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {16942#true} assume true; {16942#true} is VALID [2022-04-27 11:15:50,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16942#true} {16942#true} #94#return; {16942#true} is VALID [2022-04-27 11:15:50,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {16942#true} call ULTIMATE.init(); {16960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:50,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {16960#(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(10, 2);call #Ultimate.allocInit(12, 3); {16942#true} is VALID [2022-04-27 11:15:50,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {16942#true} assume true; {16942#true} is VALID [2022-04-27 11:15:50,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16942#true} {16942#true} #94#return; {16942#true} is VALID [2022-04-27 11:15:50,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {16942#true} call #t~ret17 := main(); {16942#true} is VALID [2022-04-27 11:15:50,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {16942#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16947#(= main_~y~0 0)} is VALID [2022-04-27 11:15:50,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {16947#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16948#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:50,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {16948#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16949#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:50,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {16949#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16950#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:50,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {16950#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16951#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:50,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {16951#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16952#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:50,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {16952#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {16952#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:50,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {16952#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {16953#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:15:50,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {16953#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16954#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:15:50,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {16954#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16955#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:50,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {16955#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16956#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:50,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {16956#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16957#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:50,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {16957#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16958#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:50,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {16958#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {16958#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:15:50,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {16958#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16957#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:15:50,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {16957#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16956#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:15:50,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {16956#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16955#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:15:50,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {16955#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16954#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:15:50,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {16954#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16953#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:15:50,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {16953#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {16953#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:15:50,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {16953#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {16953#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:15:50,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {16953#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16959#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:15:50,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {16959#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16943#false} is VALID [2022-04-27 11:15:50,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {16943#false} assume !(~y~0 % 4294967296 > 0); {16943#false} is VALID [2022-04-27 11:15:50,199 INFO L272 TraceCheckUtils]: 29: Hoare triple {16943#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16943#false} is VALID [2022-04-27 11:15:50,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {16943#false} ~cond := #in~cond; {16943#false} is VALID [2022-04-27 11:15:50,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {16943#false} assume 0 == ~cond; {16943#false} is VALID [2022-04-27 11:15:50,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {16943#false} assume !false; {16943#false} is VALID [2022-04-27 11:15:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:15:50,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:50,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357815997] [2022-04-27 11:15:50,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357815997] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:50,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832370450] [2022-04-27 11:15:50,199 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:15:50,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:50,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:50,200 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:15:50,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 11:15:50,248 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-27 11:15:50,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:50,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 11:15:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:50,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:50,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {16942#true} call ULTIMATE.init(); {16942#true} is VALID [2022-04-27 11:15:50,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {16942#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(10, 2);call #Ultimate.allocInit(12, 3); {16942#true} is VALID [2022-04-27 11:15:50,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {16942#true} assume true; {16942#true} is VALID [2022-04-27 11:15:50,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16942#true} {16942#true} #94#return; {16942#true} is VALID [2022-04-27 11:15:50,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {16942#true} call #t~ret17 := main(); {16942#true} is VALID [2022-04-27 11:15:50,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {16942#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16942#true} is VALID [2022-04-27 11:15:50,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {16942#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16982#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:50,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {16982#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16986#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:50,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {16986#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16990#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:50,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {16990#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16994#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:50,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {16994#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16998#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:15:50,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {16998#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16998#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:15:50,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {16998#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {16998#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:15:50,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {16998#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16994#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:50,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {16994#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16990#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:50,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {16990#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16986#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:50,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {16986#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16982#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:50,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {16982#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16943#false} is VALID [2022-04-27 11:15:50,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {16943#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16943#false} is VALID [2022-04-27 11:15:50,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {16943#false} assume !(~z~0 % 4294967296 > 0); {16943#false} is VALID [2022-04-27 11:15:50,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {16943#false} assume !(~y~0 % 4294967296 > 0); {16943#false} is VALID [2022-04-27 11:15:50,439 INFO L272 TraceCheckUtils]: 29: Hoare triple {16943#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16943#false} is VALID [2022-04-27 11:15:50,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {16943#false} ~cond := #in~cond; {16943#false} is VALID [2022-04-27 11:15:50,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {16943#false} assume 0 == ~cond; {16943#false} is VALID [2022-04-27 11:15:50,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {16943#false} assume !false; {16943#false} is VALID [2022-04-27 11:15:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:15:50,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:50,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {16943#false} assume !false; {16943#false} is VALID [2022-04-27 11:15:50,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {16943#false} assume 0 == ~cond; {16943#false} is VALID [2022-04-27 11:15:50,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {16943#false} ~cond := #in~cond; {16943#false} is VALID [2022-04-27 11:15:50,531 INFO L272 TraceCheckUtils]: 29: Hoare triple {16943#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16943#false} is VALID [2022-04-27 11:15:50,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {16943#false} assume !(~y~0 % 4294967296 > 0); {16943#false} is VALID [2022-04-27 11:15:50,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {16943#false} assume !(~z~0 % 4294967296 > 0); {16943#false} is VALID [2022-04-27 11:15:50,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {16943#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16943#false} is VALID [2022-04-27 11:15:50,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16943#false} is VALID [2022-04-27 11:15:50,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {17020#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {16982#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17020#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:15:50,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {16986#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16982#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:50,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {16990#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16986#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:50,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {16994#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16990#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:50,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {16998#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16994#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:50,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {16998#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {16998#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:15:50,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {16998#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16998#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:15:50,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {16994#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16998#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:15:50,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {16990#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16994#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:15:50,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {16986#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16990#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:15:50,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {16982#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16986#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:15:50,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {16942#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16982#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:15:50,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {16942#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16942#true} is VALID [2022-04-27 11:15:50,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {16942#true} call #t~ret17 := main(); {16942#true} is VALID [2022-04-27 11:15:50,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16942#true} {16942#true} #94#return; {16942#true} is VALID [2022-04-27 11:15:50,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {16942#true} assume true; {16942#true} is VALID [2022-04-27 11:15:50,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {16942#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(10, 2);call #Ultimate.allocInit(12, 3); {16942#true} is VALID [2022-04-27 11:15:50,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {16942#true} call ULTIMATE.init(); {16942#true} is VALID [2022-04-27 11:15:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:15:50,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832370450] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:50,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:50,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-27 11:15:50,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951591995] [2022-04-27 11:15:50,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:50,540 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 11:15:50,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:50,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:50,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:50,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 11:15:50,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:50,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 11:15:50,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:15:50,575 INFO L87 Difference]: Start difference. First operand 333 states and 475 transitions. Second operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:08,798 INFO L93 Difference]: Finished difference Result 951 states and 1365 transitions. [2022-04-27 11:16:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2022-04-27 11:16:08,798 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 11:16:08,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:16:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 441 transitions. [2022-04-27 11:16:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 441 transitions. [2022-04-27 11:16:08,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 176 states and 441 transitions. [2022-04-27 11:16:09,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 441 edges. 441 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:09,521 INFO L225 Difference]: With dead ends: 951 [2022-04-27 11:16:09,521 INFO L226 Difference]: Without dead ends: 884 [2022-04-27 11:16:09,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15130 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2948, Invalid=34882, Unknown=0, NotChecked=0, Total=37830 [2022-04-27 11:16:09,526 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 314 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 659 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 659 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:16:09,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 124 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [659 Valid, 2306 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-27 11:16:09,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2022-04-27 11:16:09,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 365. [2022-04-27 11:16:09,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:16:09,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 884 states. Second operand has 365 states, 360 states have (on average 1.4166666666666667) internal successors, (510), 360 states have internal predecessors, (510), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:09,827 INFO L74 IsIncluded]: Start isIncluded. First operand 884 states. Second operand has 365 states, 360 states have (on average 1.4166666666666667) internal successors, (510), 360 states have internal predecessors, (510), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:09,827 INFO L87 Difference]: Start difference. First operand 884 states. Second operand has 365 states, 360 states have (on average 1.4166666666666667) internal successors, (510), 360 states have internal predecessors, (510), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:09,850 INFO L93 Difference]: Finished difference Result 884 states and 1197 transitions. [2022-04-27 11:16:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1197 transitions. [2022-04-27 11:16:09,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:09,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:09,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 360 states have (on average 1.4166666666666667) internal successors, (510), 360 states have internal predecessors, (510), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 884 states. [2022-04-27 11:16:09,851 INFO L87 Difference]: Start difference. First operand has 365 states, 360 states have (on average 1.4166666666666667) internal successors, (510), 360 states have internal predecessors, (510), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 884 states. [2022-04-27 11:16:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:09,875 INFO L93 Difference]: Finished difference Result 884 states and 1197 transitions. [2022-04-27 11:16:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1197 transitions. [2022-04-27 11:16:09,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:09,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:09,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:16:09,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:16:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.4166666666666667) internal successors, (510), 360 states have internal predecessors, (510), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 514 transitions. [2022-04-27 11:16:09,881 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 514 transitions. Word has length 33 [2022-04-27 11:16:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:16:09,882 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 514 transitions. [2022-04-27 11:16:09,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 514 transitions. [2022-04-27 11:16:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:16:09,882 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:16:09,882 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:16:09,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 11:16:10,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:10,092 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:16:10,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:16:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 3 times [2022-04-27 11:16:10,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:16:10,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880820992] [2022-04-27 11:16:10,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:16:10,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:16:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:10,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:16:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:10,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {20776#(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(10, 2);call #Ultimate.allocInit(12, 3); {20765#true} is VALID [2022-04-27 11:16:10,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {20765#true} assume true; {20765#true} is VALID [2022-04-27 11:16:10,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20765#true} {20765#true} #94#return; {20765#true} is VALID [2022-04-27 11:16:10,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {20765#true} call ULTIMATE.init(); {20776#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:16:10,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {20776#(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(10, 2);call #Ultimate.allocInit(12, 3); {20765#true} is VALID [2022-04-27 11:16:10,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {20765#true} assume true; {20765#true} is VALID [2022-04-27 11:16:10,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20765#true} {20765#true} #94#return; {20765#true} is VALID [2022-04-27 11:16:10,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {20765#true} call #t~ret17 := main(); {20765#true} is VALID [2022-04-27 11:16:10,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {20765#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20765#true} is VALID [2022-04-27 11:16:10,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {20765#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20765#true} is VALID [2022-04-27 11:16:10,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {20765#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20765#true} is VALID [2022-04-27 11:16:10,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {20765#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20765#true} is VALID [2022-04-27 11:16:10,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {20765#true} assume !(~x~0 % 4294967296 > 0); {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:16:10,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:16:10,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:16:10,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:16:10,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,218 INFO L272 TraceCheckUtils]: 31: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20774#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:16:10,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {20774#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20775#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:16:10,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {20775#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20766#false} is VALID [2022-04-27 11:16:10,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {20766#false} assume !false; {20766#false} is VALID [2022-04-27 11:16:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:16:10,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:16:10,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880820992] [2022-04-27 11:16:10,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880820992] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:16:10,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345207757] [2022-04-27 11:16:10,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:16:10,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:10,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:16:10,220 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:16:10,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 11:16:10,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:16:10,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:16:10,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 11:16:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:10,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:16:10,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {20765#true} call ULTIMATE.init(); {20765#true} is VALID [2022-04-27 11:16:10,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {20765#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(10, 2);call #Ultimate.allocInit(12, 3); {20765#true} is VALID [2022-04-27 11:16:10,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {20765#true} assume true; {20765#true} is VALID [2022-04-27 11:16:10,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20765#true} {20765#true} #94#return; {20765#true} is VALID [2022-04-27 11:16:10,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {20765#true} call #t~ret17 := main(); {20765#true} is VALID [2022-04-27 11:16:10,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {20765#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20765#true} is VALID [2022-04-27 11:16:10,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {20765#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20765#true} is VALID [2022-04-27 11:16:10,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {20765#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20765#true} is VALID [2022-04-27 11:16:10,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {20765#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20765#true} is VALID [2022-04-27 11:16:10,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {20765#true} assume !(~x~0 % 4294967296 > 0); {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:16:10,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:16:10,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:16:10,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:16:10,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,539 INFO L272 TraceCheckUtils]: 31: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:16:10,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {20873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:16:10,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {20877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20766#false} is VALID [2022-04-27 11:16:10,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {20766#false} assume !false; {20766#false} is VALID [2022-04-27 11:16:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:16:10,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:16:10,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {20766#false} assume !false; {20766#false} is VALID [2022-04-27 11:16:10,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {20877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20766#false} is VALID [2022-04-27 11:16:10,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {20873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:16:10,793 INFO L272 TraceCheckUtils]: 31: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:16:10,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:16:10,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:16:10,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:16:10,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20773#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20772#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:16:10,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20771#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:16:10,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {20765#true} assume !(~x~0 % 4294967296 > 0); {20770#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:16:10,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {20765#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20765#true} is VALID [2022-04-27 11:16:10,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {20765#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20765#true} is VALID [2022-04-27 11:16:10,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {20765#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20765#true} is VALID [2022-04-27 11:16:10,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {20765#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20765#true} is VALID [2022-04-27 11:16:10,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {20765#true} call #t~ret17 := main(); {20765#true} is VALID [2022-04-27 11:16:10,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20765#true} {20765#true} #94#return; {20765#true} is VALID [2022-04-27 11:16:10,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {20765#true} assume true; {20765#true} is VALID [2022-04-27 11:16:10,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {20765#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(10, 2);call #Ultimate.allocInit(12, 3); {20765#true} is VALID [2022-04-27 11:16:10,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {20765#true} call ULTIMATE.init(); {20765#true} is VALID [2022-04-27 11:16:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:16:10,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345207757] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:16:10,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:16:10,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-27 11:16:10,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259965754] [2022-04-27 11:16:10,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:16:10,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:16:10,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:16:10,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:10,835 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:16:10,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:16:10,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:16:10,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:16:10,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:16:10,836 INFO L87 Difference]: Start difference. First operand 365 states and 514 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:11,672 INFO L93 Difference]: Finished difference Result 595 states and 828 transitions. [2022-04-27 11:16:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:16:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:16:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:16:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-04-27 11:16:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-04-27 11:16:11,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 73 transitions. [2022-04-27 11:16:11,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:11,740 INFO L225 Difference]: With dead ends: 595 [2022-04-27 11:16:11,740 INFO L226 Difference]: Without dead ends: 488 [2022-04-27 11:16:11,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:16:11,741 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 39 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:16:11,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 64 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:16:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-04-27 11:16:12,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 359. [2022-04-27 11:16:12,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:16:12,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 488 states. Second operand has 359 states, 354 states have (on average 1.4293785310734464) internal successors, (506), 354 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:12,020 INFO L74 IsIncluded]: Start isIncluded. First operand 488 states. Second operand has 359 states, 354 states have (on average 1.4293785310734464) internal successors, (506), 354 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:12,020 INFO L87 Difference]: Start difference. First operand 488 states. Second operand has 359 states, 354 states have (on average 1.4293785310734464) internal successors, (506), 354 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:12,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:12,031 INFO L93 Difference]: Finished difference Result 488 states and 684 transitions. [2022-04-27 11:16:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 684 transitions. [2022-04-27 11:16:12,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:12,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:12,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.4293785310734464) internal successors, (506), 354 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 488 states. [2022-04-27 11:16:12,032 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.4293785310734464) internal successors, (506), 354 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 488 states. [2022-04-27 11:16:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:12,040 INFO L93 Difference]: Finished difference Result 488 states and 684 transitions. [2022-04-27 11:16:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 684 transitions. [2022-04-27 11:16:12,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:12,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:12,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:16:12,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:16:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.4293785310734464) internal successors, (506), 354 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 510 transitions. [2022-04-27 11:16:12,046 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 510 transitions. Word has length 35 [2022-04-27 11:16:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:16:12,047 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 510 transitions. [2022-04-27 11:16:12,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 510 transitions. [2022-04-27 11:16:12,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:16:12,047 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:16:12,047 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:16:12,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 11:16:12,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:12,264 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:16:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:16:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1103922584, now seen corresponding path program 5 times [2022-04-27 11:16:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:16:12,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37639224] [2022-04-27 11:16:12,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:16:12,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:16:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:16:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:12,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {23076#(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(10, 2);call #Ultimate.allocInit(12, 3); {23057#true} is VALID [2022-04-27 11:16:12,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {23057#true} assume true; {23057#true} is VALID [2022-04-27 11:16:12,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23057#true} {23057#true} #94#return; {23057#true} is VALID [2022-04-27 11:16:12,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {23057#true} call ULTIMATE.init(); {23076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:16:12,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {23076#(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(10, 2);call #Ultimate.allocInit(12, 3); {23057#true} is VALID [2022-04-27 11:16:12,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {23057#true} assume true; {23057#true} is VALID [2022-04-27 11:16:12,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23057#true} {23057#true} #94#return; {23057#true} is VALID [2022-04-27 11:16:12,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {23057#true} call #t~ret17 := main(); {23057#true} is VALID [2022-04-27 11:16:12,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {23057#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23062#(= main_~y~0 0)} is VALID [2022-04-27 11:16:12,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {23062#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23063#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:12,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {23063#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23064#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:12,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {23064#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23065#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:12,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {23065#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23066#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:12,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {23066#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23067#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:16:12,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {23067#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23068#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:12,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {23068#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23069#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:12,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {23069#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {23069#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:12,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {23069#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {23070#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:16:12,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {23070#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23071#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:16:12,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {23071#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23072#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:16:12,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {23072#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23073#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:16:12,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {23073#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23074#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:16:12,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {23074#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23075#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:16:12,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {23075#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {23058#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {23058#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {23058#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {23058#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {23058#false} assume !(~y~0 % 4294967296 > 0); {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {23058#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {23058#false} assume !(~x~0 % 4294967296 > 0); {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {23058#false} assume !(~z~0 % 4294967296 > 0); {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {23058#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {23058#false} assume !(~y~0 % 4294967296 > 0); {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L272 TraceCheckUtils]: 31: Hoare triple {23058#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {23058#false} ~cond := #in~cond; {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {23058#false} assume 0 == ~cond; {23058#false} is VALID [2022-04-27 11:16:12,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {23058#false} assume !false; {23058#false} is VALID [2022-04-27 11:16:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:16:12,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:16:12,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37639224] [2022-04-27 11:16:12,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37639224] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:16:12,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730786160] [2022-04-27 11:16:12,476 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:16:12,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:12,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:16:12,477 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:16:12,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 11:16:12,559 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-04-27 11:16:12,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:16:12,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 11:16:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:12,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:16:12,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {23057#true} call ULTIMATE.init(); {23057#true} is VALID [2022-04-27 11:16:12,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {23057#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(10, 2);call #Ultimate.allocInit(12, 3); {23057#true} is VALID [2022-04-27 11:16:12,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {23057#true} assume true; {23057#true} is VALID [2022-04-27 11:16:12,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23057#true} {23057#true} #94#return; {23057#true} is VALID [2022-04-27 11:16:12,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {23057#true} call #t~ret17 := main(); {23057#true} is VALID [2022-04-27 11:16:12,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {23057#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23062#(= main_~y~0 0)} is VALID [2022-04-27 11:16:12,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {23062#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23063#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:12,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {23063#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23064#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:12,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {23064#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23065#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:12,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {23065#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23066#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:12,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {23066#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23067#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:16:12,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {23067#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23068#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:12,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {23068#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23069#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:12,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {23069#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {23069#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:12,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {23069#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {23122#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:12,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {23122#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23126#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:16:12,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {23126#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23130#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:16:12,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {23130#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23134#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:12,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {23134#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23138#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:12,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {23138#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23069#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:12,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {23069#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~z~0 % 4294967296 > 0); {23069#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:12,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {23069#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23068#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:12,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {23068#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23067#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:16:12,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {23067#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23066#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:12,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {23066#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23065#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:12,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {23065#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~y~0 % 4294967296 > 0); {23058#false} is VALID [2022-04-27 11:16:12,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {23058#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23058#false} is VALID [2022-04-27 11:16:12,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {23058#false} assume !(~x~0 % 4294967296 > 0); {23058#false} is VALID [2022-04-27 11:16:12,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {23058#false} assume !(~z~0 % 4294967296 > 0); {23058#false} is VALID [2022-04-27 11:16:12,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {23058#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {23058#false} is VALID [2022-04-27 11:16:12,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {23058#false} assume !(~y~0 % 4294967296 > 0); {23058#false} is VALID [2022-04-27 11:16:12,912 INFO L272 TraceCheckUtils]: 31: Hoare triple {23058#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {23058#false} is VALID [2022-04-27 11:16:12,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {23058#false} ~cond := #in~cond; {23058#false} is VALID [2022-04-27 11:16:12,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {23058#false} assume 0 == ~cond; {23058#false} is VALID [2022-04-27 11:16:12,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {23058#false} assume !false; {23058#false} is VALID [2022-04-27 11:16:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:16:12,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:16:13,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {23058#false} assume !false; {23058#false} is VALID [2022-04-27 11:16:13,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {23058#false} assume 0 == ~cond; {23058#false} is VALID [2022-04-27 11:16:13,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {23058#false} ~cond := #in~cond; {23058#false} is VALID [2022-04-27 11:16:13,186 INFO L272 TraceCheckUtils]: 31: Hoare triple {23058#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {23058#false} is VALID [2022-04-27 11:16:13,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {23058#false} assume !(~y~0 % 4294967296 > 0); {23058#false} is VALID [2022-04-27 11:16:13,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {23058#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {23058#false} is VALID [2022-04-27 11:16:13,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {23058#false} assume !(~z~0 % 4294967296 > 0); {23058#false} is VALID [2022-04-27 11:16:13,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {23058#false} assume !(~x~0 % 4294967296 > 0); {23058#false} is VALID [2022-04-27 11:16:13,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {23058#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23058#false} is VALID [2022-04-27 11:16:13,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {23214#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {23058#false} is VALID [2022-04-27 11:16:13,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {23218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23214#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:16:13,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {23222#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:16:13,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {23226#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23222#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:16:13,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {23230#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23226#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:13,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {23230#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {23230#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:16:13,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {23237#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23230#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:16:13,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {23241#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23237#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:16:13,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {23245#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23241#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:16:13,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {23249#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23245#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:16:13,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {23253#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23249#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:16:13,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {23057#true} ~z~0 := ~y~0; {23253#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:16:13,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {23057#true} assume !(~x~0 % 4294967296 > 0); {23057#true} is VALID [2022-04-27 11:16:13,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {23057#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23057#true} is VALID [2022-04-27 11:16:13,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {23057#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23057#true} is VALID [2022-04-27 11:16:13,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {23057#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23057#true} is VALID [2022-04-27 11:16:13,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {23057#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23057#true} is VALID [2022-04-27 11:16:13,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {23057#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23057#true} is VALID [2022-04-27 11:16:13,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {23057#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23057#true} is VALID [2022-04-27 11:16:13,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {23057#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23057#true} is VALID [2022-04-27 11:16:13,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {23057#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23057#true} is VALID [2022-04-27 11:16:13,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {23057#true} call #t~ret17 := main(); {23057#true} is VALID [2022-04-27 11:16:13,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23057#true} {23057#true} #94#return; {23057#true} is VALID [2022-04-27 11:16:13,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {23057#true} assume true; {23057#true} is VALID [2022-04-27 11:16:13,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {23057#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(10, 2);call #Ultimate.allocInit(12, 3); {23057#true} is VALID [2022-04-27 11:16:13,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {23057#true} call ULTIMATE.init(); {23057#true} is VALID [2022-04-27 11:16:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 11:16:13,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730786160] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:16:13,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:16:13,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 12] total 32 [2022-04-27 11:16:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123381635] [2022-04-27 11:16:13,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:16:13,197 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.75) internal successors, (56), 31 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:16:13,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:16:13,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.75) internal successors, (56), 31 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:13,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:13,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-27 11:16:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:16:13,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-27 11:16:13,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2022-04-27 11:16:13,259 INFO L87 Difference]: Start difference. First operand 359 states and 510 transitions. Second operand has 32 states, 32 states have (on average 1.75) internal successors, (56), 31 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:16,965 INFO L93 Difference]: Finished difference Result 740 states and 1113 transitions. [2022-04-27 11:16:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-27 11:16:16,965 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.75) internal successors, (56), 31 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:16:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:16:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.75) internal successors, (56), 31 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 250 transitions. [2022-04-27 11:16:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.75) internal successors, (56), 31 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 250 transitions. [2022-04-27 11:16:16,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 250 transitions. [2022-04-27 11:16:17,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:17,271 INFO L225 Difference]: With dead ends: 740 [2022-04-27 11:16:17,271 INFO L226 Difference]: Without dead ends: 651 [2022-04-27 11:16:17,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1314, Invalid=5006, Unknown=0, NotChecked=0, Total=6320 [2022-04-27 11:16:17,272 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 288 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:16:17,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 112 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 11:16:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-04-27 11:16:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 421. [2022-04-27 11:16:17,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:16:17,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 651 states. Second operand has 421 states, 416 states have (on average 1.4302884615384615) internal successors, (595), 416 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:17,660 INFO L74 IsIncluded]: Start isIncluded. First operand 651 states. Second operand has 421 states, 416 states have (on average 1.4302884615384615) internal successors, (595), 416 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:17,660 INFO L87 Difference]: Start difference. First operand 651 states. Second operand has 421 states, 416 states have (on average 1.4302884615384615) internal successors, (595), 416 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:17,672 INFO L93 Difference]: Finished difference Result 651 states and 929 transitions. [2022-04-27 11:16:17,672 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 929 transitions. [2022-04-27 11:16:17,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:17,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:17,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 421 states, 416 states have (on average 1.4302884615384615) internal successors, (595), 416 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 651 states. [2022-04-27 11:16:17,674 INFO L87 Difference]: Start difference. First operand has 421 states, 416 states have (on average 1.4302884615384615) internal successors, (595), 416 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 651 states. [2022-04-27 11:16:17,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:17,688 INFO L93 Difference]: Finished difference Result 651 states and 929 transitions. [2022-04-27 11:16:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 929 transitions. [2022-04-27 11:16:17,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:17,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:17,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:16:17,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:16:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.4302884615384615) internal successors, (595), 416 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 599 transitions. [2022-04-27 11:16:17,695 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 599 transitions. Word has length 35 [2022-04-27 11:16:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:16:17,696 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 599 transitions. [2022-04-27 11:16:17,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.75) internal successors, (56), 31 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 599 transitions. [2022-04-27 11:16:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:16:17,696 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:16:17,696 INFO L195 NwaCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:16:17,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 11:16:17,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:17,901 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:16:17,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:16:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash -856081542, now seen corresponding path program 4 times [2022-04-27 11:16:17,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:16:17,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125511588] [2022-04-27 11:16:17,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:16:17,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:16:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:18,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:16:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:18,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {26051#(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(10, 2);call #Ultimate.allocInit(12, 3); {26032#true} is VALID [2022-04-27 11:16:18,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {26032#true} assume true; {26032#true} is VALID [2022-04-27 11:16:18,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26032#true} {26032#true} #94#return; {26032#true} is VALID [2022-04-27 11:16:18,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {26032#true} call ULTIMATE.init(); {26051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:16:18,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {26051#(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(10, 2);call #Ultimate.allocInit(12, 3); {26032#true} is VALID [2022-04-27 11:16:18,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {26032#true} assume true; {26032#true} is VALID [2022-04-27 11:16:18,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26032#true} {26032#true} #94#return; {26032#true} is VALID [2022-04-27 11:16:18,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {26032#true} call #t~ret17 := main(); {26032#true} is VALID [2022-04-27 11:16:18,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {26032#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26037#(= main_~y~0 0)} is VALID [2022-04-27 11:16:18,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {26037#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:18,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {26038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:18,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {26039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:18,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {26040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:18,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {26041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26042#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:16:18,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {26042#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26043#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:18,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {26043#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26044#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:18,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {26044#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26045#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:16:18,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {26045#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26046#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:16:18,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {26046#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26047#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:16:18,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {26047#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26048#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:16:18,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {26048#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {26048#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:16:18,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {26048#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {26049#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:16:18,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {26049#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26050#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:16:18,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {26050#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {26033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26033#false} is VALID [2022-04-27 11:16:18,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {26033#false} assume !(~y~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {26033#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26033#false} is VALID [2022-04-27 11:16:18,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {26033#false} assume !(~x~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {26033#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26033#false} is VALID [2022-04-27 11:16:18,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {26033#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26033#false} is VALID [2022-04-27 11:16:18,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {26033#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26033#false} is VALID [2022-04-27 11:16:18,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {26033#false} assume !(~z~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {26033#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26033#false} is VALID [2022-04-27 11:16:18,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {26033#false} assume !(~y~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,109 INFO L272 TraceCheckUtils]: 31: Hoare triple {26033#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26033#false} is VALID [2022-04-27 11:16:18,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {26033#false} ~cond := #in~cond; {26033#false} is VALID [2022-04-27 11:16:18,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {26033#false} assume 0 == ~cond; {26033#false} is VALID [2022-04-27 11:16:18,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {26033#false} assume !false; {26033#false} is VALID [2022-04-27 11:16:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:16:18,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:16:18,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125511588] [2022-04-27 11:16:18,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125511588] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:16:18,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908192166] [2022-04-27 11:16:18,109 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:16:18,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:18,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:16:18,110 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:16:18,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-27 11:16:18,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:16:18,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:16:18,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 11:16:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:18,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:16:18,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {26032#true} call ULTIMATE.init(); {26032#true} is VALID [2022-04-27 11:16:18,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {26032#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(10, 2);call #Ultimate.allocInit(12, 3); {26032#true} is VALID [2022-04-27 11:16:18,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {26032#true} assume true; {26032#true} is VALID [2022-04-27 11:16:18,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26032#true} {26032#true} #94#return; {26032#true} is VALID [2022-04-27 11:16:18,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {26032#true} call #t~ret17 := main(); {26032#true} is VALID [2022-04-27 11:16:18,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {26032#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26037#(= main_~y~0 0)} is VALID [2022-04-27 11:16:18,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {26037#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:18,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {26038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:18,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {26039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:18,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {26040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:18,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {26041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26042#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:16:18,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {26042#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26043#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:18,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {26043#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26044#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:16:18,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {26044#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26045#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:16:18,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {26045#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26046#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:16:18,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {26046#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26047#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:16:18,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {26047#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26048#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:16:18,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {26048#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {26048#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:16:18,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {26048#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {26049#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:16:18,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {26049#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26112#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-27 11:16:18,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {26112#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {26033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26033#false} is VALID [2022-04-27 11:16:18,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {26033#false} assume !(~y~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {26033#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26033#false} is VALID [2022-04-27 11:16:18,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {26033#false} assume !(~x~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {26033#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26033#false} is VALID [2022-04-27 11:16:18,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {26033#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26033#false} is VALID [2022-04-27 11:16:18,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {26033#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26033#false} is VALID [2022-04-27 11:16:18,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {26033#false} assume !(~z~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {26033#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26033#false} is VALID [2022-04-27 11:16:18,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {26033#false} assume !(~y~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,417 INFO L272 TraceCheckUtils]: 31: Hoare triple {26033#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26033#false} is VALID [2022-04-27 11:16:18,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {26033#false} ~cond := #in~cond; {26033#false} is VALID [2022-04-27 11:16:18,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {26033#false} assume 0 == ~cond; {26033#false} is VALID [2022-04-27 11:16:18,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {26033#false} assume !false; {26033#false} is VALID [2022-04-27 11:16:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:16:18,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:16:18,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {26033#false} assume !false; {26033#false} is VALID [2022-04-27 11:16:18,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {26033#false} assume 0 == ~cond; {26033#false} is VALID [2022-04-27 11:16:18,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {26033#false} ~cond := #in~cond; {26033#false} is VALID [2022-04-27 11:16:18,759 INFO L272 TraceCheckUtils]: 31: Hoare triple {26033#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26033#false} is VALID [2022-04-27 11:16:18,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {26033#false} assume !(~y~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {26033#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26033#false} is VALID [2022-04-27 11:16:18,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {26033#false} assume !(~z~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {26033#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26033#false} is VALID [2022-04-27 11:16:18,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {26033#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26033#false} is VALID [2022-04-27 11:16:18,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {26033#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26033#false} is VALID [2022-04-27 11:16:18,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {26033#false} assume !(~x~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {26033#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26033#false} is VALID [2022-04-27 11:16:18,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {26033#false} assume !(~y~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {26033#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26033#false} is VALID [2022-04-27 11:16:18,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {26200#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {26033#false} is VALID [2022-04-27 11:16:18,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {26204#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26200#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:16:18,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {26208#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {26204#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:16:18,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {26208#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {26208#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:16:18,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {26215#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26208#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:16:18,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {26219#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26215#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:16:18,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {26223#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26219#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:16:18,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {26227#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26223#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:16:18,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {26231#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26227#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:16:18,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {26235#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26231#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:16:18,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {26239#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26235#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:16:18,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {26243#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26239#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:16:18,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {26247#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26243#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:16:18,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {26251#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26247#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:16:18,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {26255#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26251#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:16:18,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {26032#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26255#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:16:18,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {26032#true} call #t~ret17 := main(); {26032#true} is VALID [2022-04-27 11:16:18,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26032#true} {26032#true} #94#return; {26032#true} is VALID [2022-04-27 11:16:18,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {26032#true} assume true; {26032#true} is VALID [2022-04-27 11:16:18,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {26032#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(10, 2);call #Ultimate.allocInit(12, 3); {26032#true} is VALID [2022-04-27 11:16:18,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {26032#true} call ULTIMATE.init(); {26032#true} is VALID [2022-04-27 11:16:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:16:18,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908192166] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:16:18,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:16:18,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-27 11:16:18,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764654807] [2022-04-27 11:16:18,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:16:18,769 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:16:18,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:16:18,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:18,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:18,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-27 11:16:18,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:16:18,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-27 11:16:18,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2022-04-27 11:16:18,801 INFO L87 Difference]: Start difference. First operand 421 states and 599 transitions. Second operand has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:38,050 INFO L93 Difference]: Finished difference Result 1474 states and 2267 transitions. [2022-04-27 11:17:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-04-27 11:17:38,050 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:17:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:38,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 468 transitions. [2022-04-27 11:17:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 468 transitions. [2022-04-27 11:17:38,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 468 transitions. [2022-04-27 11:17:43,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:43,419 INFO L225 Difference]: With dead ends: 1474 [2022-04-27 11:17:43,419 INFO L226 Difference]: Without dead ends: 1351 [2022-04-27 11:17:43,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10411 ImplicationChecksByTransitivity, 70.1s TimeCoverageRelationStatistics Valid=6197, Invalid=20863, Unknown=0, NotChecked=0, Total=27060 [2022-04-27 11:17:43,421 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 1352 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 1488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 3144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1488 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:43,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 134 Invalid, 3144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1488 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-27 11:17:43,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-04-27 11:17:44,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 564. [2022-04-27 11:17:44,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:44,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1351 states. Second operand has 564 states, 559 states have (on average 1.4257602862254024) internal successors, (797), 559 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:44,105 INFO L74 IsIncluded]: Start isIncluded. First operand 1351 states. Second operand has 564 states, 559 states have (on average 1.4257602862254024) internal successors, (797), 559 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:44,106 INFO L87 Difference]: Start difference. First operand 1351 states. Second operand has 564 states, 559 states have (on average 1.4257602862254024) internal successors, (797), 559 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:44,152 INFO L93 Difference]: Finished difference Result 1351 states and 1854 transitions. [2022-04-27 11:17:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1854 transitions. [2022-04-27 11:17:44,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:44,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:44,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 564 states, 559 states have (on average 1.4257602862254024) internal successors, (797), 559 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1351 states. [2022-04-27 11:17:44,154 INFO L87 Difference]: Start difference. First operand has 564 states, 559 states have (on average 1.4257602862254024) internal successors, (797), 559 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1351 states. [2022-04-27 11:17:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:44,201 INFO L93 Difference]: Finished difference Result 1351 states and 1854 transitions. [2022-04-27 11:17:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1854 transitions. [2022-04-27 11:17:44,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:44,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:44,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:44,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 559 states have (on average 1.4257602862254024) internal successors, (797), 559 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 801 transitions. [2022-04-27 11:17:44,213 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 801 transitions. Word has length 35 [2022-04-27 11:17:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:44,214 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 801 transitions. [2022-04-27 11:17:44,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 801 transitions. [2022-04-27 11:17:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 11:17:44,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:44,214 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:44,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-27 11:17:44,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:44,426 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:44,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash -224601084, now seen corresponding path program 7 times [2022-04-27 11:17:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:44,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434455476] [2022-04-27 11:17:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:44,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:44,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {31583#(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(10, 2);call #Ultimate.allocInit(12, 3); {31563#true} is VALID [2022-04-27 11:17:44,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {31563#true} assume true; {31563#true} is VALID [2022-04-27 11:17:44,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31563#true} {31563#true} #94#return; {31563#true} is VALID [2022-04-27 11:17:44,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {31563#true} call ULTIMATE.init(); {31583#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:44,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {31583#(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(10, 2);call #Ultimate.allocInit(12, 3); {31563#true} is VALID [2022-04-27 11:17:44,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {31563#true} assume true; {31563#true} is VALID [2022-04-27 11:17:44,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31563#true} {31563#true} #94#return; {31563#true} is VALID [2022-04-27 11:17:44,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {31563#true} call #t~ret17 := main(); {31563#true} is VALID [2022-04-27 11:17:44,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {31563#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31568#(= main_~y~0 0)} is VALID [2022-04-27 11:17:44,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {31568#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31569#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:44,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {31569#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31570#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:44,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {31570#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31571#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:44,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {31571#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31572#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:44,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {31572#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31573#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:44,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {31573#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31574#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:44,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {31574#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {31574#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:44,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {31574#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {31575#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:17:44,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {31575#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31576#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:17:44,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {31576#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31577#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:17:44,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {31577#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31578#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:17:44,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {31578#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31579#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:17:44,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {31579#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31580#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:17:44,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {31580#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31581#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:17:44,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {31581#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {31581#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:17:44,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {31581#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31580#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:17:44,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {31580#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31579#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:17:44,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {31579#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31578#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:17:44,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {31578#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31577#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:17:44,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {31577#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31576#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:17:44,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {31576#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31575#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:17:44,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {31575#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {31575#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:17:44,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {31575#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {31575#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:17:44,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {31575#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {31582#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:17:44,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {31582#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {31564#false} is VALID [2022-04-27 11:17:44,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {31564#false} assume !(~y~0 % 4294967296 > 0); {31564#false} is VALID [2022-04-27 11:17:44,699 INFO L272 TraceCheckUtils]: 32: Hoare triple {31564#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31564#false} is VALID [2022-04-27 11:17:44,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {31564#false} ~cond := #in~cond; {31564#false} is VALID [2022-04-27 11:17:44,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {31564#false} assume 0 == ~cond; {31564#false} is VALID [2022-04-27 11:17:44,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {31564#false} assume !false; {31564#false} is VALID [2022-04-27 11:17:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:17:44,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:44,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434455476] [2022-04-27 11:17:44,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434455476] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:44,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215757622] [2022-04-27 11:17:44,699 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:17:44,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:44,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:44,700 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:17:44,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-27 11:17:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:44,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 11:17:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:44,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:44,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {31563#true} call ULTIMATE.init(); {31563#true} is VALID [2022-04-27 11:17:44,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {31563#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(10, 2);call #Ultimate.allocInit(12, 3); {31563#true} is VALID [2022-04-27 11:17:44,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {31563#true} assume true; {31563#true} is VALID [2022-04-27 11:17:44,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31563#true} {31563#true} #94#return; {31563#true} is VALID [2022-04-27 11:17:44,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {31563#true} call #t~ret17 := main(); {31563#true} is VALID [2022-04-27 11:17:44,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {31563#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31563#true} is VALID [2022-04-27 11:17:44,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {31563#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31605#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:17:44,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {31605#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31609#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:17:44,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {31609#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31613#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:17:44,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {31613#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31617#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:17:44,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {31617#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31621#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:17:44,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {31621#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31625#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:17:44,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {31625#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {31625#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:17:44,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {31625#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {31625#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:17:44,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {31625#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31621#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:17:44,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {31621#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31617#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:17:44,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {31617#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31613#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:17:44,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {31613#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31609#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:17:44,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {31609#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31605#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:17:44,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {31605#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:44,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:44,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:44,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:44,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:44,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:44,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:44,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:44,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:44,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {31564#false} is VALID [2022-04-27 11:17:44,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {31564#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {31564#false} is VALID [2022-04-27 11:17:44,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {31564#false} assume !(~z~0 % 4294967296 > 0); {31564#false} is VALID [2022-04-27 11:17:44,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {31564#false} assume !(~y~0 % 4294967296 > 0); {31564#false} is VALID [2022-04-27 11:17:44,974 INFO L272 TraceCheckUtils]: 32: Hoare triple {31564#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31564#false} is VALID [2022-04-27 11:17:44,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {31564#false} ~cond := #in~cond; {31564#false} is VALID [2022-04-27 11:17:44,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {31564#false} assume 0 == ~cond; {31564#false} is VALID [2022-04-27 11:17:44,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {31564#false} assume !false; {31564#false} is VALID [2022-04-27 11:17:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 11:17:44,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:45,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {31564#false} assume !false; {31564#false} is VALID [2022-04-27 11:17:45,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {31564#false} assume 0 == ~cond; {31564#false} is VALID [2022-04-27 11:17:45,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {31564#false} ~cond := #in~cond; {31564#false} is VALID [2022-04-27 11:17:45,078 INFO L272 TraceCheckUtils]: 32: Hoare triple {31564#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31564#false} is VALID [2022-04-27 11:17:45,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {31564#false} assume !(~y~0 % 4294967296 > 0); {31564#false} is VALID [2022-04-27 11:17:45,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {31564#false} assume !(~z~0 % 4294967296 > 0); {31564#false} is VALID [2022-04-27 11:17:45,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {31564#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {31564#false} is VALID [2022-04-27 11:17:45,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {31564#false} is VALID [2022-04-27 11:17:45,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:45,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:45,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:45,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:45,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:45,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:45,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:45,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {31650#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:45,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {31605#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31650#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:45,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {31609#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31605#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:17:45,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {31613#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31609#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:17:45,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {31617#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31613#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:17:45,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {31621#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31617#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:17:45,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {31625#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31621#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:17:45,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {31625#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {31625#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:17:45,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {31625#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {31625#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:17:45,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {31621#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31625#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:17:45,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {31617#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31621#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:17:45,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {31613#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31617#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:17:45,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {31609#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31613#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:17:45,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {31605#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31609#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:17:45,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {31563#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31605#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:17:45,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {31563#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31563#true} is VALID [2022-04-27 11:17:45,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {31563#true} call #t~ret17 := main(); {31563#true} is VALID [2022-04-27 11:17:45,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31563#true} {31563#true} #94#return; {31563#true} is VALID [2022-04-27 11:17:45,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {31563#true} assume true; {31563#true} is VALID [2022-04-27 11:17:45,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {31563#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(10, 2);call #Ultimate.allocInit(12, 3); {31563#true} is VALID [2022-04-27 11:17:45,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {31563#true} call ULTIMATE.init(); {31563#true} is VALID [2022-04-27 11:17:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 11:17:45,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215757622] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:45,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:45,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-27 11:17:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106921209] [2022-04-27 11:17:45,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:45,090 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-27 11:17:45,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:45,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:45,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:45,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 11:17:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:45,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 11:17:45,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:17:45,129 INFO L87 Difference]: Start difference. First operand 564 states and 801 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:25,453 INFO L93 Difference]: Finished difference Result 1708 states and 2349 transitions. [2022-04-27 11:18:25,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2022-04-27 11:18:25,453 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-27 11:18:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:18:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 582 transitions. [2022-04-27 11:18:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 582 transitions. [2022-04-27 11:18:25,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 582 transitions. [2022-04-27 11:18:26,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 582 edges. 582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:18:26,699 INFO L225 Difference]: With dead ends: 1708 [2022-04-27 11:18:26,699 INFO L226 Difference]: Without dead ends: 1598 [2022-04-27 11:18:26,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33007 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=5057, Invalid=73063, Unknown=0, NotChecked=0, Total=78120 [2022-04-27 11:18:26,703 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 441 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 3306 mSolverCounterSat, 1030 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 4336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1030 IncrementalHoareTripleChecker+Valid, 3306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:18:26,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 140 Invalid, 4336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1030 Valid, 3306 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-04-27 11:18:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2022-04-27 11:18:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 627. [2022-04-27 11:18:27,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:18:27,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1598 states. Second operand has 627 states, 622 states have (on average 1.4308681672025723) internal successors, (890), 622 states have internal predecessors, (890), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:27,426 INFO L74 IsIncluded]: Start isIncluded. First operand 1598 states. Second operand has 627 states, 622 states have (on average 1.4308681672025723) internal successors, (890), 622 states have internal predecessors, (890), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:27,426 INFO L87 Difference]: Start difference. First operand 1598 states. Second operand has 627 states, 622 states have (on average 1.4308681672025723) internal successors, (890), 622 states have internal predecessors, (890), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:27,495 INFO L93 Difference]: Finished difference Result 1598 states and 2061 transitions. [2022-04-27 11:18:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2061 transitions. [2022-04-27 11:18:27,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:27,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:27,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 627 states, 622 states have (on average 1.4308681672025723) internal successors, (890), 622 states have internal predecessors, (890), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1598 states. [2022-04-27 11:18:27,497 INFO L87 Difference]: Start difference. First operand has 627 states, 622 states have (on average 1.4308681672025723) internal successors, (890), 622 states have internal predecessors, (890), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1598 states. [2022-04-27 11:18:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:27,571 INFO L93 Difference]: Finished difference Result 1598 states and 2061 transitions. [2022-04-27 11:18:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2061 transitions. [2022-04-27 11:18:27,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:27,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:27,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:18:27,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:18:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 622 states have (on average 1.4308681672025723) internal successors, (890), 622 states have internal predecessors, (890), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 894 transitions. [2022-04-27 11:18:27,586 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 894 transitions. Word has length 36 [2022-04-27 11:18:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:18:27,586 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 894 transitions. [2022-04-27 11:18:27,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 894 transitions. [2022-04-27 11:18:27,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 11:18:27,587 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:18:27,587 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:18:27,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 11:18:27,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:18:27,803 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:18:27,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:18:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1034985127, now seen corresponding path program 5 times [2022-04-27 11:18:27,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:18:27,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948013426] [2022-04-27 11:18:27,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:18:27,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:18:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:27,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:18:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:27,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {38143#(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(10, 2);call #Ultimate.allocInit(12, 3); {38129#true} is VALID [2022-04-27 11:18:27,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {38129#true} assume true; {38129#true} is VALID [2022-04-27 11:18:27,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38129#true} {38129#true} #94#return; {38129#true} is VALID [2022-04-27 11:18:27,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {38129#true} call ULTIMATE.init(); {38143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:18:27,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {38143#(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(10, 2);call #Ultimate.allocInit(12, 3); {38129#true} is VALID [2022-04-27 11:18:27,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {38129#true} assume true; {38129#true} is VALID [2022-04-27 11:18:27,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38129#true} {38129#true} #94#return; {38129#true} is VALID [2022-04-27 11:18:27,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {38129#true} call #t~ret17 := main(); {38129#true} is VALID [2022-04-27 11:18:27,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {38129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38129#true} is VALID [2022-04-27 11:18:27,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {38129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38134#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:18:27,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {38134#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38135#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-27 11:18:27,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {38135#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38136#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:18:27,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {38136#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38137#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:18:27,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {38137#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {38137#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:18:27,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {38137#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {38137#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:18:27,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {38137#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38138#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:18:27,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {38138#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38139#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:18:27,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {38139#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38140#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:18:27,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {38140#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:18:27,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:18:27,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:18:27,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:18:27,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:18:27,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:18:27,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:18:27,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {38141#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38140#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:18:27,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {38140#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38142#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:18:27,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {38142#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {38130#false} is VALID [2022-04-27 11:18:27,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {38130#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38130#false} is VALID [2022-04-27 11:18:27,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {38130#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38130#false} is VALID [2022-04-27 11:18:27,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {38130#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38130#false} is VALID [2022-04-27 11:18:27,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {38130#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38130#false} is VALID [2022-04-27 11:18:27,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {38130#false} assume !(~z~0 % 4294967296 > 0); {38130#false} is VALID [2022-04-27 11:18:27,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {38130#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {38130#false} is VALID [2022-04-27 11:18:27,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {38130#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {38130#false} is VALID [2022-04-27 11:18:27,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {38130#false} assume !(~y~0 % 4294967296 > 0); {38130#false} is VALID [2022-04-27 11:18:27,973 INFO L272 TraceCheckUtils]: 33: Hoare triple {38130#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {38130#false} is VALID [2022-04-27 11:18:27,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {38130#false} ~cond := #in~cond; {38130#false} is VALID [2022-04-27 11:18:27,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {38130#false} assume 0 == ~cond; {38130#false} is VALID [2022-04-27 11:18:27,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {38130#false} assume !false; {38130#false} is VALID [2022-04-27 11:18:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-27 11:18:27,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:18:27,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948013426] [2022-04-27 11:18:27,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948013426] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:18:27,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134584423] [2022-04-27 11:18:27,974 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:18:27,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:18:27,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:18:27,975 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:18:27,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-27 11:18:28,104 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-04-27 11:18:28,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:18:28,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 11:18:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:28,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:18:28,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {38129#true} call ULTIMATE.init(); {38129#true} is VALID [2022-04-27 11:18:28,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {38129#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(10, 2);call #Ultimate.allocInit(12, 3); {38129#true} is VALID [2022-04-27 11:18:28,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {38129#true} assume true; {38129#true} is VALID [2022-04-27 11:18:28,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38129#true} {38129#true} #94#return; {38129#true} is VALID [2022-04-27 11:18:28,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {38129#true} call #t~ret17 := main(); {38129#true} is VALID [2022-04-27 11:18:28,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {38129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38129#true} is VALID [2022-04-27 11:18:28,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {38129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38129#true} is VALID [2022-04-27 11:18:28,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {38129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38129#true} is VALID [2022-04-27 11:18:28,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {38129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38134#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:18:28,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {38134#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:18:28,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {38174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {38174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:18:28,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {38174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {38174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:18:28,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {38174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38134#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:18:28,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {38134#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38187#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {38187#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38191#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {38191#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38191#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {38191#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38187#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {38187#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {38130#false} is VALID [2022-04-27 11:18:28,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {38130#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38130#false} is VALID [2022-04-27 11:18:28,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {38130#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38130#false} is VALID [2022-04-27 11:18:28,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {38130#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38130#false} is VALID [2022-04-27 11:18:28,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {38130#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38130#false} is VALID [2022-04-27 11:18:28,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {38130#false} assume !(~z~0 % 4294967296 > 0); {38130#false} is VALID [2022-04-27 11:18:28,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {38130#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {38130#false} is VALID [2022-04-27 11:18:28,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {38130#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {38130#false} is VALID [2022-04-27 11:18:28,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {38130#false} assume !(~y~0 % 4294967296 > 0); {38130#false} is VALID [2022-04-27 11:18:28,391 INFO L272 TraceCheckUtils]: 33: Hoare triple {38130#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {38130#false} is VALID [2022-04-27 11:18:28,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {38130#false} ~cond := #in~cond; {38130#false} is VALID [2022-04-27 11:18:28,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {38130#false} assume 0 == ~cond; {38130#false} is VALID [2022-04-27 11:18:28,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {38130#false} assume !false; {38130#false} is VALID [2022-04-27 11:18:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 11:18:28,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:18:28,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {38130#false} assume !false; {38130#false} is VALID [2022-04-27 11:18:28,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {38130#false} assume 0 == ~cond; {38130#false} is VALID [2022-04-27 11:18:28,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {38130#false} ~cond := #in~cond; {38130#false} is VALID [2022-04-27 11:18:28,497 INFO L272 TraceCheckUtils]: 33: Hoare triple {38130#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {38130#false} is VALID [2022-04-27 11:18:28,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {38130#false} assume !(~y~0 % 4294967296 > 0); {38130#false} is VALID [2022-04-27 11:18:28,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {38130#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {38130#false} is VALID [2022-04-27 11:18:28,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {38130#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {38130#false} is VALID [2022-04-27 11:18:28,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {38130#false} assume !(~z~0 % 4294967296 > 0); {38130#false} is VALID [2022-04-27 11:18:28,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {38130#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38130#false} is VALID [2022-04-27 11:18:28,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {38130#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38130#false} is VALID [2022-04-27 11:18:28,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {38130#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38130#false} is VALID [2022-04-27 11:18:28,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {38130#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38130#false} is VALID [2022-04-27 11:18:28,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {38187#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {38130#false} is VALID [2022-04-27 11:18:28,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {38191#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38187#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38191#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {38191#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38195#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {38187#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38191#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {38134#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38187#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:28,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {38174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38134#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:18:28,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {38174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {38174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:18:28,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {38174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {38174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:18:28,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {38134#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:18:28,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {38129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38134#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:18:28,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {38129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38129#true} is VALID [2022-04-27 11:18:28,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {38129#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38129#true} is VALID [2022-04-27 11:18:28,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {38129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38129#true} is VALID [2022-04-27 11:18:28,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {38129#true} call #t~ret17 := main(); {38129#true} is VALID [2022-04-27 11:18:28,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38129#true} {38129#true} #94#return; {38129#true} is VALID [2022-04-27 11:18:28,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {38129#true} assume true; {38129#true} is VALID [2022-04-27 11:18:28,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {38129#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(10, 2);call #Ultimate.allocInit(12, 3); {38129#true} is VALID [2022-04-27 11:18:28,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {38129#true} call ULTIMATE.init(); {38129#true} is VALID [2022-04-27 11:18:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 11:18:28,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134584423] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:18:28,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:18:28,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 16 [2022-04-27 11:18:28,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594890311] [2022-04-27 11:18:28,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:18:28,507 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 11:18:28,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:18:28,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:28,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:18:28,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:18:28,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:18:28,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:18:28,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:18:28,549 INFO L87 Difference]: Start difference. First operand 627 states and 894 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:31,113 INFO L93 Difference]: Finished difference Result 1295 states and 1733 transitions. [2022-04-27 11:18:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 11:18:31,113 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 11:18:31,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:18:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 151 transitions. [2022-04-27 11:18:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 151 transitions. [2022-04-27 11:18:31,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 151 transitions. [2022-04-27 11:18:31,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:18:31,320 INFO L225 Difference]: With dead ends: 1295 [2022-04-27 11:18:31,320 INFO L226 Difference]: Without dead ends: 1226 [2022-04-27 11:18:31,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=310, Invalid=1172, Unknown=0, NotChecked=0, Total=1482 [2022-04-27 11:18:31,321 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 135 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:18:31,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 71 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:18:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-04-27 11:18:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 660. [2022-04-27 11:18:32,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:18:32,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1226 states. Second operand has 660 states, 655 states have (on average 1.4122137404580153) internal successors, (925), 655 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:32,109 INFO L74 IsIncluded]: Start isIncluded. First operand 1226 states. Second operand has 660 states, 655 states have (on average 1.4122137404580153) internal successors, (925), 655 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:32,110 INFO L87 Difference]: Start difference. First operand 1226 states. Second operand has 660 states, 655 states have (on average 1.4122137404580153) internal successors, (925), 655 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:32,150 INFO L93 Difference]: Finished difference Result 1226 states and 1624 transitions. [2022-04-27 11:18:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1624 transitions. [2022-04-27 11:18:32,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:32,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:32,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 660 states, 655 states have (on average 1.4122137404580153) internal successors, (925), 655 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1226 states. [2022-04-27 11:18:32,152 INFO L87 Difference]: Start difference. First operand has 660 states, 655 states have (on average 1.4122137404580153) internal successors, (925), 655 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1226 states. [2022-04-27 11:18:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:32,192 INFO L93 Difference]: Finished difference Result 1226 states and 1624 transitions. [2022-04-27 11:18:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1624 transitions. [2022-04-27 11:18:32,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:32,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:32,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:18:32,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:18:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 655 states have (on average 1.4122137404580153) internal successors, (925), 655 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 929 transitions. [2022-04-27 11:18:32,207 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 929 transitions. Word has length 37 [2022-04-27 11:18:32,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:18:32,207 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 929 transitions. [2022-04-27 11:18:32,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 929 transitions. [2022-04-27 11:18:32,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 11:18:32,208 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:18:32,208 INFO L195 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:18:32,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-27 11:18:32,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-27 11:18:32,412 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:18:32,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:18:32,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2096911303, now seen corresponding path program 6 times [2022-04-27 11:18:32,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:18:32,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621587986] [2022-04-27 11:18:32,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:18:32,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:18:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:18:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:32,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {43086#(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(10, 2);call #Ultimate.allocInit(12, 3); {43065#true} is VALID [2022-04-27 11:18:32,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {43065#true} assume true; {43065#true} is VALID [2022-04-27 11:18:32,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43065#true} {43065#true} #94#return; {43065#true} is VALID [2022-04-27 11:18:32,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {43065#true} call ULTIMATE.init(); {43086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:18:32,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {43086#(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(10, 2);call #Ultimate.allocInit(12, 3); {43065#true} is VALID [2022-04-27 11:18:32,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {43065#true} assume true; {43065#true} is VALID [2022-04-27 11:18:32,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43065#true} {43065#true} #94#return; {43065#true} is VALID [2022-04-27 11:18:32,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {43065#true} call #t~ret17 := main(); {43065#true} is VALID [2022-04-27 11:18:32,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {43065#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43070#(= main_~y~0 0)} is VALID [2022-04-27 11:18:32,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {43070#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43071#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:18:32,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {43071#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43072#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:18:32,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {43072#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43073#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:18:32,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {43073#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43074#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:18:32,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {43074#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43075#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:18:32,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {43075#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43076#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:32,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {43076#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43077#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:18:32,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {43077#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43078#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:18:32,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {43078#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43079#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:18:32,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {43079#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43080#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:18:32,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {43080#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43081#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:18:32,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {43081#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43082#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:18:32,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {43082#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {43082#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:18:32,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {43082#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {43083#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:18:32,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {43083#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43084#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:18:32,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {43084#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43085#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:18:32,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {43085#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {43066#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {43066#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {43066#false} assume !(~y~0 % 4294967296 > 0); {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {43066#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {43066#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {43066#false} assume !(~x~0 % 4294967296 > 0); {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {43066#false} assume !(~z~0 % 4294967296 > 0); {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {43066#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {43066#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {43066#false} assume !(~y~0 % 4294967296 > 0); {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L272 TraceCheckUtils]: 33: Hoare triple {43066#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {43066#false} ~cond := #in~cond; {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {43066#false} assume 0 == ~cond; {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {43066#false} assume !false; {43066#false} is VALID [2022-04-27 11:18:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:18:32,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:18:32,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621587986] [2022-04-27 11:18:32,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621587986] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:18:32,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683025464] [2022-04-27 11:18:32,648 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:18:32,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:18:32,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:18:32,649 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:18:32,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-27 11:18:32,687 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-27 11:18:32,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:18:32,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 11:18:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:32,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:18:32,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {43065#true} call ULTIMATE.init(); {43065#true} is VALID [2022-04-27 11:18:32,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {43065#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(10, 2);call #Ultimate.allocInit(12, 3); {43065#true} is VALID [2022-04-27 11:18:32,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {43065#true} assume true; {43065#true} is VALID [2022-04-27 11:18:32,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43065#true} {43065#true} #94#return; {43065#true} is VALID [2022-04-27 11:18:32,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {43065#true} call #t~ret17 := main(); {43065#true} is VALID [2022-04-27 11:18:32,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {43065#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43065#true} is VALID [2022-04-27 11:18:32,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:32,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:32,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:32,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:32,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:32,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:32,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:32,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:32,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:32,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:32,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:32,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:32,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {43065#true} assume !(~x~0 % 4294967296 > 0); {43065#true} is VALID [2022-04-27 11:18:32,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {43065#true} ~z~0 := ~y~0; {43147#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:18:32,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {43147#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43151#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-27 11:18:32,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {43151#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43155#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:18:32,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {43155#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {43155#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:18:32,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {43155#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43147#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:18:32,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {43147#(= main_~z~0 main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43165#(= (+ main_~y~0 2) main_~z~0)} is VALID [2022-04-27 11:18:32,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {43165#(= (+ main_~y~0 2) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {43165#(= (+ main_~y~0 2) main_~z~0)} is VALID [2022-04-27 11:18:32,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {43165#(= (+ main_~y~0 2) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {43172#(= main_~y~0 (+ (- 1) main_~z~0))} is VALID [2022-04-27 11:18:32,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {43172#(= main_~y~0 (+ (- 1) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {43147#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:18:32,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {43147#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {43147#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:18:32,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {43147#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {43182#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:18:32,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {43182#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {43066#false} is VALID [2022-04-27 11:18:32,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {43066#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {43066#false} is VALID [2022-04-27 11:18:32,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {43066#false} assume !(~y~0 % 4294967296 > 0); {43066#false} is VALID [2022-04-27 11:18:32,885 INFO L272 TraceCheckUtils]: 33: Hoare triple {43066#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {43066#false} is VALID [2022-04-27 11:18:32,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {43066#false} ~cond := #in~cond; {43066#false} is VALID [2022-04-27 11:18:32,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {43066#false} assume 0 == ~cond; {43066#false} is VALID [2022-04-27 11:18:32,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {43066#false} assume !false; {43066#false} is VALID [2022-04-27 11:18:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-27 11:18:32,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:18:33,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {43066#false} assume !false; {43066#false} is VALID [2022-04-27 11:18:33,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {43066#false} assume 0 == ~cond; {43066#false} is VALID [2022-04-27 11:18:33,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {43066#false} ~cond := #in~cond; {43066#false} is VALID [2022-04-27 11:18:33,172 INFO L272 TraceCheckUtils]: 33: Hoare triple {43066#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {43066#false} is VALID [2022-04-27 11:18:33,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {43066#false} assume !(~y~0 % 4294967296 > 0); {43066#false} is VALID [2022-04-27 11:18:33,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {43066#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {43066#false} is VALID [2022-04-27 11:18:33,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {43182#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {43066#false} is VALID [2022-04-27 11:18:33,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {43225#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {43182#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:18:33,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {43225#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {43225#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:18:33,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {43232#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {43225#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:18:33,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {43236#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 2) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {43232#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-27 11:18:33,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {43236#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 2) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {43236#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 2) 4294967296))))} is VALID [2022-04-27 11:18:33,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {43243#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43236#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 2) 4294967296))))} is VALID [2022-04-27 11:18:33,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {43247#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43243#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-27 11:18:33,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {43247#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} assume !(~z~0 % 4294967296 > 0); {43247#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:18:33,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {43254#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43247#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:18:33,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {43225#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43254#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {43065#true} ~z~0 := ~y~0; {43225#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {43065#true} assume !(~x~0 % 4294967296 > 0); {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {43065#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {43065#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43065#true} is VALID [2022-04-27 11:18:33,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {43065#true} call #t~ret17 := main(); {43065#true} is VALID [2022-04-27 11:18:33,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43065#true} {43065#true} #94#return; {43065#true} is VALID [2022-04-27 11:18:33,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {43065#true} assume true; {43065#true} is VALID [2022-04-27 11:18:33,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {43065#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(10, 2);call #Ultimate.allocInit(12, 3); {43065#true} is VALID [2022-04-27 11:18:33,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {43065#true} call ULTIMATE.init(); {43065#true} is VALID [2022-04-27 11:18:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-27 11:18:33,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683025464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:18:33,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:18:33,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8, 9] total 31 [2022-04-27 11:18:33,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910379247] [2022-04-27 11:18:33,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:18:33,180 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 11:18:33,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:18:33,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:33,218 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:18:33,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-27 11:18:33,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:18:33,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-27 11:18:33,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:18:33,218 INFO L87 Difference]: Start difference. First operand 660 states and 929 transitions. Second operand has 31 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:46,682 INFO L93 Difference]: Finished difference Result 1167 states and 1688 transitions. [2022-04-27 11:18:46,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-04-27 11:18:46,682 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 11:18:46,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:18:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 357 transitions. [2022-04-27 11:18:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 357 transitions. [2022-04-27 11:18:46,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 357 transitions. [2022-04-27 11:18:47,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:18:47,073 INFO L225 Difference]: With dead ends: 1167 [2022-04-27 11:18:47,074 INFO L226 Difference]: Without dead ends: 1030 [2022-04-27 11:18:47,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6358 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1695, Invalid=19185, Unknown=0, NotChecked=0, Total=20880 [2022-04-27 11:18:47,075 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 247 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4375 mSolverCounterSat, 633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 5008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Valid, 4375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:18:47,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 158 Invalid, 5008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [633 Valid, 4375 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-27 11:18:47,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2022-04-27 11:18:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 711. [2022-04-27 11:18:47,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:18:47,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1030 states. Second operand has 711 states, 706 states have (on average 1.3909348441926346) internal successors, (982), 706 states have internal predecessors, (982), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:47,916 INFO L74 IsIncluded]: Start isIncluded. First operand 1030 states. Second operand has 711 states, 706 states have (on average 1.3909348441926346) internal successors, (982), 706 states have internal predecessors, (982), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:47,916 INFO L87 Difference]: Start difference. First operand 1030 states. Second operand has 711 states, 706 states have (on average 1.3909348441926346) internal successors, (982), 706 states have internal predecessors, (982), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:47,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:47,945 INFO L93 Difference]: Finished difference Result 1030 states and 1403 transitions. [2022-04-27 11:18:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1403 transitions. [2022-04-27 11:18:47,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:47,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:47,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 711 states, 706 states have (on average 1.3909348441926346) internal successors, (982), 706 states have internal predecessors, (982), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1030 states. [2022-04-27 11:18:47,946 INFO L87 Difference]: Start difference. First operand has 711 states, 706 states have (on average 1.3909348441926346) internal successors, (982), 706 states have internal predecessors, (982), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1030 states. [2022-04-27 11:18:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:47,976 INFO L93 Difference]: Finished difference Result 1030 states and 1403 transitions. [2022-04-27 11:18:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1403 transitions. [2022-04-27 11:18:47,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:47,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:47,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:18:47,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:18:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 706 states have (on average 1.3909348441926346) internal successors, (982), 706 states have internal predecessors, (982), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 986 transitions. [2022-04-27 11:18:47,992 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 986 transitions. Word has length 37 [2022-04-27 11:18:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:18:47,992 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 986 transitions. [2022-04-27 11:18:47,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 30 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 986 transitions. [2022-04-27 11:18:47,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 11:18:47,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:18:47,993 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:18:48,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-27 11:18:48,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-27 11:18:48,194 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:18:48,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:18:48,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1063665465, now seen corresponding path program 7 times [2022-04-27 11:18:48,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:18:48,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216259172] [2022-04-27 11:18:48,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:18:48,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:18:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:18:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:48,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {47750#(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(10, 2);call #Ultimate.allocInit(12, 3); {47730#true} is VALID [2022-04-27 11:18:48,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {47730#true} assume true; {47730#true} is VALID [2022-04-27 11:18:48,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47730#true} {47730#true} #94#return; {47730#true} is VALID [2022-04-27 11:18:48,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {47730#true} call ULTIMATE.init(); {47750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:18:48,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {47750#(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(10, 2);call #Ultimate.allocInit(12, 3); {47730#true} is VALID [2022-04-27 11:18:48,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {47730#true} assume true; {47730#true} is VALID [2022-04-27 11:18:48,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47730#true} {47730#true} #94#return; {47730#true} is VALID [2022-04-27 11:18:48,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {47730#true} call #t~ret17 := main(); {47730#true} is VALID [2022-04-27 11:18:48,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {47730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47735#(= main_~y~0 0)} is VALID [2022-04-27 11:18:48,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {47735#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47736#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:18:48,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {47736#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47737#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:18:48,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {47737#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47738#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:18:48,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {47738#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47739#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:18:48,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {47739#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47740#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:18:48,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {47740#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47741#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:48,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {47741#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47742#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:18:48,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {47742#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {47742#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:18:48,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {47742#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {47743#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:18:48,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {47743#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47744#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:18:48,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {47744#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47745#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:18:48,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {47745#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47746#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:18:48,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {47746#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47747#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:18:48,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {47747#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47748#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:18:48,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {47748#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47749#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:18:48,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {47749#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {47731#false} is VALID [2022-04-27 11:18:48,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {47731#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {47731#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {47731#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {47731#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {47731#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {47731#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {47731#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {47731#false} assume !(~y~0 % 4294967296 > 0); {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {47731#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {47731#false} assume !(~x~0 % 4294967296 > 0); {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {47731#false} assume !(~z~0 % 4294967296 > 0); {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {47731#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {47731#false} assume !(~y~0 % 4294967296 > 0); {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L272 TraceCheckUtils]: 35: Hoare triple {47731#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 36: Hoare triple {47731#false} ~cond := #in~cond; {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {47731#false} assume 0 == ~cond; {47731#false} is VALID [2022-04-27 11:18:48,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {47731#false} assume !false; {47731#false} is VALID [2022-04-27 11:18:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 11:18:48,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:18:48,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216259172] [2022-04-27 11:18:48,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216259172] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:18:48,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121017999] [2022-04-27 11:18:48,424 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:18:48,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:18:48,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:18:48,425 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:18:48,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-27 11:18:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:48,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 11:18:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:48,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:18:48,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {47730#true} call ULTIMATE.init(); {47730#true} is VALID [2022-04-27 11:18:48,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {47730#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(10, 2);call #Ultimate.allocInit(12, 3); {47730#true} is VALID [2022-04-27 11:18:48,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {47730#true} assume true; {47730#true} is VALID [2022-04-27 11:18:48,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47730#true} {47730#true} #94#return; {47730#true} is VALID [2022-04-27 11:18:48,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {47730#true} call #t~ret17 := main(); {47730#true} is VALID [2022-04-27 11:18:48,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {47730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47730#true} is VALID [2022-04-27 11:18:48,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {47730#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47730#true} is VALID [2022-04-27 11:18:48,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {47730#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47730#true} is VALID [2022-04-27 11:18:48,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {47730#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47778#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:18:48,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {47778#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47782#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:18:48,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {47782#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47786#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:18:48,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {47786#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47790#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:18:48,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {47790#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47794#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:18:48,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {47794#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {47794#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:18:48,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {47794#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {47794#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:18:48,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {47794#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47790#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:18:48,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {47790#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47786#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:18:48,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {47786#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47782#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:18:48,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {47782#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47778#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:18:48,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {47778#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47816#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:18:48,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {47816#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47816#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:18:48,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {47816#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {47731#false} is VALID [2022-04-27 11:18:48,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {47731#false} assume !(~z~0 % 4294967296 > 0); {47731#false} is VALID [2022-04-27 11:18:48,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {47731#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {47731#false} is VALID [2022-04-27 11:18:48,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {47731#false} assume !(~y~0 % 4294967296 > 0); {47731#false} is VALID [2022-04-27 11:18:48,728 INFO L272 TraceCheckUtils]: 35: Hoare triple {47731#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {47731#false} is VALID [2022-04-27 11:18:48,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {47731#false} ~cond := #in~cond; {47731#false} is VALID [2022-04-27 11:18:48,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {47731#false} assume 0 == ~cond; {47731#false} is VALID [2022-04-27 11:18:48,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {47731#false} assume !false; {47731#false} is VALID [2022-04-27 11:18:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 15 proven. 32 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-27 11:18:48,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:18:48,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {47731#false} assume !false; {47731#false} is VALID [2022-04-27 11:18:48,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {47731#false} assume 0 == ~cond; {47731#false} is VALID [2022-04-27 11:18:48,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {47731#false} ~cond := #in~cond; {47731#false} is VALID [2022-04-27 11:18:48,847 INFO L272 TraceCheckUtils]: 35: Hoare triple {47731#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {47731#false} is VALID [2022-04-27 11:18:48,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {47731#false} assume !(~y~0 % 4294967296 > 0); {47731#false} is VALID [2022-04-27 11:18:48,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {47731#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {47731#false} is VALID [2022-04-27 11:18:48,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {47731#false} assume !(~z~0 % 4294967296 > 0); {47731#false} is VALID [2022-04-27 11:18:48,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {47816#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {47731#false} is VALID [2022-04-27 11:18:48,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47816#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:18:48,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {47816#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47820#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:48,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {47778#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47816#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:18:48,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {47782#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47778#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:18:48,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {47786#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47782#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:18:48,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {47790#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47786#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:18:48,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {47794#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47790#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:18:48,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {47794#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {47794#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:18:48,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {47794#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {47794#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:18:48,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {47790#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47794#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:18:48,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {47786#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47790#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:18:48,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {47782#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47786#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:18:48,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {47778#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47782#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:18:48,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {47730#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47778#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:18:48,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {47730#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47730#true} is VALID [2022-04-27 11:18:48,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {47730#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47730#true} is VALID [2022-04-27 11:18:48,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {47730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47730#true} is VALID [2022-04-27 11:18:48,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {47730#true} call #t~ret17 := main(); {47730#true} is VALID [2022-04-27 11:18:48,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47730#true} {47730#true} #94#return; {47730#true} is VALID [2022-04-27 11:18:48,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {47730#true} assume true; {47730#true} is VALID [2022-04-27 11:18:48,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {47730#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(10, 2);call #Ultimate.allocInit(12, 3); {47730#true} is VALID [2022-04-27 11:18:48,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {47730#true} call ULTIMATE.init(); {47730#true} is VALID [2022-04-27 11:18:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 15 proven. 32 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-27 11:18:48,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121017999] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:18:48,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:18:48,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-27 11:18:48,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973254806] [2022-04-27 11:18:48,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:18:48,860 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 11:18:48,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:18:48,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:48,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:18:48,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 11:18:48,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:18:48,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 11:18:48,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:18:48,895 INFO L87 Difference]: Start difference. First operand 711 states and 986 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:20,029 INFO L93 Difference]: Finished difference Result 1815 states and 2363 transitions. [2022-04-27 11:19:20,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2022-04-27 11:19:20,029 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 11:19:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 611 transitions. [2022-04-27 11:19:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 611 transitions. [2022-04-27 11:19:20,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 611 transitions. [2022-04-27 11:19:21,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 611 edges. 611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:21,574 INFO L225 Difference]: With dead ends: 1815 [2022-04-27 11:19:21,574 INFO L226 Difference]: Without dead ends: 1712 [2022-04-27 11:19:21,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28898 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=4665, Invalid=64767, Unknown=0, NotChecked=0, Total=69432 [2022-04-27 11:19:21,578 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 440 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2731 mSolverCounterSat, 761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 761 IncrementalHoareTripleChecker+Valid, 2731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:21,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 149 Invalid, 3492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [761 Valid, 2731 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-04-27 11:19:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-04-27 11:19:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 661. [2022-04-27 11:19:22,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:22,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1712 states. Second operand has 661 states, 656 states have (on average 1.4054878048780488) internal successors, (922), 656 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:22,445 INFO L74 IsIncluded]: Start isIncluded. First operand 1712 states. Second operand has 661 states, 656 states have (on average 1.4054878048780488) internal successors, (922), 656 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:22,445 INFO L87 Difference]: Start difference. First operand 1712 states. Second operand has 661 states, 656 states have (on average 1.4054878048780488) internal successors, (922), 656 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:22,530 INFO L93 Difference]: Finished difference Result 1712 states and 2195 transitions. [2022-04-27 11:19:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2195 transitions. [2022-04-27 11:19:22,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:22,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:22,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 661 states, 656 states have (on average 1.4054878048780488) internal successors, (922), 656 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1712 states. [2022-04-27 11:19:22,533 INFO L87 Difference]: Start difference. First operand has 661 states, 656 states have (on average 1.4054878048780488) internal successors, (922), 656 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1712 states. [2022-04-27 11:19:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:22,614 INFO L93 Difference]: Finished difference Result 1712 states and 2195 transitions. [2022-04-27 11:19:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2195 transitions. [2022-04-27 11:19:22,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:22,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:22,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:22,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 656 states have (on average 1.4054878048780488) internal successors, (922), 656 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 926 transitions. [2022-04-27 11:19:22,630 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 926 transitions. Word has length 39 [2022-04-27 11:19:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:22,630 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 926 transitions. [2022-04-27 11:19:22,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:22,630 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 926 transitions. [2022-04-27 11:19:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 11:19:22,630 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:22,630 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:22,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-27 11:19:22,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-27 11:19:22,835 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:22,836 INFO L85 PathProgramCache]: Analyzing trace with hash -439094120, now seen corresponding path program 8 times [2022-04-27 11:19:22,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:22,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200475519] [2022-04-27 11:19:22,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:22,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:23,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:23,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {54685#(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(10, 2);call #Ultimate.allocInit(12, 3); {54663#true} is VALID [2022-04-27 11:19:23,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {54663#true} assume true; {54663#true} is VALID [2022-04-27 11:19:23,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54663#true} {54663#true} #94#return; {54663#true} is VALID [2022-04-27 11:19:23,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {54663#true} call ULTIMATE.init(); {54685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:23,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {54685#(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(10, 2);call #Ultimate.allocInit(12, 3); {54663#true} is VALID [2022-04-27 11:19:23,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {54663#true} assume true; {54663#true} is VALID [2022-04-27 11:19:23,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54663#true} {54663#true} #94#return; {54663#true} is VALID [2022-04-27 11:19:23,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {54663#true} call #t~ret17 := main(); {54663#true} is VALID [2022-04-27 11:19:23,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {54663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54668#(= main_~y~0 0)} is VALID [2022-04-27 11:19:23,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {54668#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54669#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:19:23,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {54669#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54670#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:19:23,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {54670#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54671#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:19:23,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {54671#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54672#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:19:23,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {54672#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54673#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:19:23,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {54673#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54674#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:23,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {54674#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:23,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {54675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {54675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:23,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {54675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {54676#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:19:23,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {54676#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54677#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:19:23,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {54677#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54678#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:19:23,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {54678#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54679#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:19:23,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {54679#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54680#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:19:23,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {54680#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54681#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:19:23,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {54681#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54682#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:19:23,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {54682#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54683#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:19:23,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {54683#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {54683#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:19:23,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {54683#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54682#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:19:23,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {54682#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54681#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:19:23,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {54681#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54680#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:19:23,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {54680#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54679#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:19:23,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {54679#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54678#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:19:23,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {54678#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54677#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:19:23,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {54677#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54676#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:19:23,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {54676#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {54676#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:19:23,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {54676#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {54676#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:19:23,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {54676#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54684#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-27 11:19:23,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {54684#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {54664#false} is VALID [2022-04-27 11:19:23,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {54664#false} assume !(~y~0 % 4294967296 > 0); {54664#false} is VALID [2022-04-27 11:19:23,133 INFO L272 TraceCheckUtils]: 35: Hoare triple {54664#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {54664#false} is VALID [2022-04-27 11:19:23,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {54664#false} ~cond := #in~cond; {54664#false} is VALID [2022-04-27 11:19:23,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {54664#false} assume 0 == ~cond; {54664#false} is VALID [2022-04-27 11:19:23,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {54664#false} assume !false; {54664#false} is VALID [2022-04-27 11:19:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:19:23,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:23,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200475519] [2022-04-27 11:19:23,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200475519] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:23,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201898719] [2022-04-27 11:19:23,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:19:23,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:23,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:23,135 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:19:23,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-27 11:19:23,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:19:23,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:19:23,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 11:19:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:23,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:23,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {54663#true} call ULTIMATE.init(); {54663#true} is VALID [2022-04-27 11:19:23,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {54663#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(10, 2);call #Ultimate.allocInit(12, 3); {54663#true} is VALID [2022-04-27 11:19:23,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {54663#true} assume true; {54663#true} is VALID [2022-04-27 11:19:23,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54663#true} {54663#true} #94#return; {54663#true} is VALID [2022-04-27 11:19:23,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {54663#true} call #t~ret17 := main(); {54663#true} is VALID [2022-04-27 11:19:23,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {54663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54663#true} is VALID [2022-04-27 11:19:23,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {54663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:19:23,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {54707#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54711#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:19:23,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {54711#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54715#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:19:23,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {54715#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54719#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:19:23,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {54719#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54723#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:19:23,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {54723#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54727#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:19:23,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {54727#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54731#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:19:23,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {54731#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {54731#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:19:23,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {54731#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {54731#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:19:23,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {54731#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54727#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:19:23,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {54727#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54723#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:19:23,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {54723#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54719#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:19:23,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {54719#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54715#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:19:23,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {54715#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54711#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:19:23,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {54711#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:19:23,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {54707#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {54664#false} is VALID [2022-04-27 11:19:23,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {54664#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54664#false} is VALID [2022-04-27 11:19:23,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {54664#false} assume !(~z~0 % 4294967296 > 0); {54664#false} is VALID [2022-04-27 11:19:23,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {54664#false} assume !(~y~0 % 4294967296 > 0); {54664#false} is VALID [2022-04-27 11:19:23,450 INFO L272 TraceCheckUtils]: 35: Hoare triple {54664#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {54664#false} is VALID [2022-04-27 11:19:23,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {54664#false} ~cond := #in~cond; {54664#false} is VALID [2022-04-27 11:19:23,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {54664#false} assume 0 == ~cond; {54664#false} is VALID [2022-04-27 11:19:23,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {54664#false} assume !false; {54664#false} is VALID [2022-04-27 11:19:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-27 11:19:23,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:23,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {54664#false} assume !false; {54664#false} is VALID [2022-04-27 11:19:23,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {54664#false} assume 0 == ~cond; {54664#false} is VALID [2022-04-27 11:19:23,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {54664#false} ~cond := #in~cond; {54664#false} is VALID [2022-04-27 11:19:23,565 INFO L272 TraceCheckUtils]: 35: Hoare triple {54664#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {54664#false} is VALID [2022-04-27 11:19:23,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {54664#false} assume !(~y~0 % 4294967296 > 0); {54664#false} is VALID [2022-04-27 11:19:23,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {54664#false} assume !(~z~0 % 4294967296 > 0); {54664#false} is VALID [2022-04-27 11:19:23,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {54664#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {54664#false} is VALID [2022-04-27 11:19:23,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {54664#false} is VALID [2022-04-27 11:19:23,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {54759#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {54707#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54759#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:19:23,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {54711#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:19:23,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {54715#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54711#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:19:23,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {54719#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54715#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:19:23,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {54723#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54719#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:19:23,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {54727#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54723#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:19:23,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {54731#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54727#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:19:23,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {54731#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {54731#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:19:23,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {54731#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {54731#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:19:23,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {54727#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54731#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:19:23,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {54723#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54727#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:19:23,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {54719#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54723#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:19:23,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {54715#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54719#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:19:23,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {54711#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54715#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:19:23,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {54707#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54711#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:19:23,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {54663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:19:23,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {54663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54663#true} is VALID [2022-04-27 11:19:23,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {54663#true} call #t~ret17 := main(); {54663#true} is VALID [2022-04-27 11:19:23,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54663#true} {54663#true} #94#return; {54663#true} is VALID [2022-04-27 11:19:23,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {54663#true} assume true; {54663#true} is VALID [2022-04-27 11:19:23,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {54663#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(10, 2);call #Ultimate.allocInit(12, 3); {54663#true} is VALID [2022-04-27 11:19:23,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {54663#true} call ULTIMATE.init(); {54663#true} is VALID [2022-04-27 11:19:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-27 11:19:23,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201898719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:23,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:23,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-27 11:19:23,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936419453] [2022-04-27 11:19:23,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:23,578 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 11:19:23,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:23,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:23,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:23,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 11:19:23,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:23,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 11:19:23,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:19:23,624 INFO L87 Difference]: Start difference. First operand 661 states and 926 transitions. Second operand has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:59,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:20:59,797 INFO L93 Difference]: Finished difference Result 2176 states and 2907 transitions. [2022-04-27 11:20:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 364 states. [2022-04-27 11:20:59,798 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 11:20:59,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:20:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 773 transitions. [2022-04-27 11:20:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 773 transitions. [2022-04-27 11:20:59,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 773 transitions. [2022-04-27 11:21:01,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 773 edges. 773 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:02,013 INFO L225 Difference]: With dead ends: 2176 [2022-04-27 11:21:02,013 INFO L226 Difference]: Without dead ends: 2073 [2022-04-27 11:21:02,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66276 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=8545, Invalid=142387, Unknown=0, NotChecked=0, Total=150932 [2022-04-27 11:21:02,023 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 538 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 5052 mSolverCounterSat, 1320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1320 IncrementalHoareTripleChecker+Valid, 5052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:21:02,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 160 Invalid, 6372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1320 Valid, 5052 Invalid, 0 Unknown, 0 Unchecked, 26.7s Time] [2022-04-27 11:21:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2022-04-27 11:21:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 768. [2022-04-27 11:21:03,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:21:03,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2073 states. Second operand has 768 states, 763 states have (on average 1.3918741808650066) internal successors, (1062), 763 states have internal predecessors, (1062), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:03,023 INFO L74 IsIncluded]: Start isIncluded. First operand 2073 states. Second operand has 768 states, 763 states have (on average 1.3918741808650066) internal successors, (1062), 763 states have internal predecessors, (1062), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:03,023 INFO L87 Difference]: Start difference. First operand 2073 states. Second operand has 768 states, 763 states have (on average 1.3918741808650066) internal successors, (1062), 763 states have internal predecessors, (1062), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:03,139 INFO L93 Difference]: Finished difference Result 2073 states and 2614 transitions. [2022-04-27 11:21:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 2614 transitions. [2022-04-27 11:21:03,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:03,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:03,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 768 states, 763 states have (on average 1.3918741808650066) internal successors, (1062), 763 states have internal predecessors, (1062), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2073 states. [2022-04-27 11:21:03,141 INFO L87 Difference]: Start difference. First operand has 768 states, 763 states have (on average 1.3918741808650066) internal successors, (1062), 763 states have internal predecessors, (1062), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2073 states. [2022-04-27 11:21:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:03,257 INFO L93 Difference]: Finished difference Result 2073 states and 2614 transitions. [2022-04-27 11:21:03,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 2614 transitions. [2022-04-27 11:21:03,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:03,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:03,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:21:03,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:21:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 763 states have (on average 1.3918741808650066) internal successors, (1062), 763 states have internal predecessors, (1062), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1066 transitions. [2022-04-27 11:21:03,276 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1066 transitions. Word has length 39 [2022-04-27 11:21:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:21:03,276 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1066 transitions. [2022-04-27 11:21:03,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1066 transitions. [2022-04-27 11:21:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 11:21:03,277 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:21:03,277 INFO L195 NwaCegarLoop]: trace histogram [13, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:21:03,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-27 11:21:03,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:03,478 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:21:03,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:21:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1547664359, now seen corresponding path program 6 times [2022-04-27 11:21:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:21:03,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392398387] [2022-04-27 11:21:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:21:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:21:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:03,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:21:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:03,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {63080#(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(10, 2);call #Ultimate.allocInit(12, 3); {63058#true} is VALID [2022-04-27 11:21:03,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {63058#true} assume true; {63058#true} is VALID [2022-04-27 11:21:03,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63058#true} {63058#true} #94#return; {63058#true} is VALID [2022-04-27 11:21:03,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {63058#true} call ULTIMATE.init(); {63080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:21:03,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {63080#(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(10, 2);call #Ultimate.allocInit(12, 3); {63058#true} is VALID [2022-04-27 11:21:03,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {63058#true} assume true; {63058#true} is VALID [2022-04-27 11:21:03,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63058#true} {63058#true} #94#return; {63058#true} is VALID [2022-04-27 11:21:03,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {63058#true} call #t~ret17 := main(); {63058#true} is VALID [2022-04-27 11:21:03,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {63058#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63063#(= main_~y~0 0)} is VALID [2022-04-27 11:21:03,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {63063#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63064#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:21:03,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {63064#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63065#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:21:03,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {63065#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63066#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:21:03,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {63066#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63067#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:21:03,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {63067#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63068#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:21:03,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {63068#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63069#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:03,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {63069#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63070#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:21:03,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {63070#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63071#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:21:03,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {63071#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63072#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:21:03,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {63072#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63073#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:21:03,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {63073#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63074#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:21:03,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {63074#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63075#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:21:03,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {63075#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63076#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:21:03,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {63076#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {63076#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:21:03,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {63076#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {63077#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:21:03,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {63077#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63078#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:21:03,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {63078#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63079#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-27 11:21:03,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {63079#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {63059#false} is VALID [2022-04-27 11:21:03,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {63059#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63059#false} is VALID [2022-04-27 11:21:03,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {63059#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {63059#false} assume !(~y~0 % 4294967296 > 0); {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {63059#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {63059#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {63059#false} assume !(~x~0 % 4294967296 > 0); {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {63059#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {63059#false} assume !(~z~0 % 4294967296 > 0); {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {63059#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {63059#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {63059#false} assume !(~y~0 % 4294967296 > 0); {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L272 TraceCheckUtils]: 35: Hoare triple {63059#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {63059#false} ~cond := #in~cond; {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {63059#false} assume 0 == ~cond; {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {63059#false} assume !false; {63059#false} is VALID [2022-04-27 11:21:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:21:03,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:21:03,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392398387] [2022-04-27 11:21:03,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392398387] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:21:03,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262001936] [2022-04-27 11:21:03,797 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:21:03,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:03,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:21:03,798 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:21:03,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-27 11:21:03,842 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-27 11:21:03,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:21:03,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 11:21:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:03,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:21:04,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {63058#true} call ULTIMATE.init(); {63058#true} is VALID [2022-04-27 11:21:04,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {63058#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(10, 2);call #Ultimate.allocInit(12, 3); {63058#true} is VALID [2022-04-27 11:21:04,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {63058#true} assume true; {63058#true} is VALID [2022-04-27 11:21:04,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63058#true} {63058#true} #94#return; {63058#true} is VALID [2022-04-27 11:21:04,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {63058#true} call #t~ret17 := main(); {63058#true} is VALID [2022-04-27 11:21:04,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {63058#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {63058#true} assume !(~x~0 % 4294967296 > 0); {63058#true} is VALID [2022-04-27 11:21:04,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {63058#true} ~z~0 := ~y~0; {63144#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:21:04,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {63144#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63148#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-27 11:21:04,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {63148#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63152#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-27 11:21:04,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {63152#(= main_~y~0 (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {63152#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-27 11:21:04,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {63152#(= main_~y~0 (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63144#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:21:04,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {63144#(= main_~z~0 main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63162#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:21:04,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {63162#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {63162#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:21:04,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {63162#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {63169#(and (= main_~y~0 (+ (- 1) main_~z~0)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:21:04,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {63169#(and (= main_~y~0 (+ (- 1) main_~z~0)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {63173#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:21:04,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {63173#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {63173#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:21:04,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {63173#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63180#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:21:04,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {63180#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {63059#false} is VALID [2022-04-27 11:21:04,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {63059#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {63059#false} is VALID [2022-04-27 11:21:04,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {63059#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {63059#false} is VALID [2022-04-27 11:21:04,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {63059#false} assume !(~y~0 % 4294967296 > 0); {63059#false} is VALID [2022-04-27 11:21:04,093 INFO L272 TraceCheckUtils]: 35: Hoare triple {63059#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {63059#false} is VALID [2022-04-27 11:21:04,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {63059#false} ~cond := #in~cond; {63059#false} is VALID [2022-04-27 11:21:04,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {63059#false} assume 0 == ~cond; {63059#false} is VALID [2022-04-27 11:21:04,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {63059#false} assume !false; {63059#false} is VALID [2022-04-27 11:21:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-27 11:21:04,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:21:04,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {63059#false} assume !false; {63059#false} is VALID [2022-04-27 11:21:04,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {63059#false} assume 0 == ~cond; {63059#false} is VALID [2022-04-27 11:21:04,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {63059#false} ~cond := #in~cond; {63059#false} is VALID [2022-04-27 11:21:04,336 INFO L272 TraceCheckUtils]: 35: Hoare triple {63059#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {63059#false} is VALID [2022-04-27 11:21:04,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {63059#false} assume !(~y~0 % 4294967296 > 0); {63059#false} is VALID [2022-04-27 11:21:04,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {63059#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {63059#false} is VALID [2022-04-27 11:21:04,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {63059#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {63059#false} is VALID [2022-04-27 11:21:04,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {63226#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {63059#false} is VALID [2022-04-27 11:21:04,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {63230#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63226#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:21:04,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {63230#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {63230#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:04,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {63230#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {63230#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:04,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {63230#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {63230#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:04,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {63230#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {63230#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:04,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {63246#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod main_~y~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63230#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:04,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {63250#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63246#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:21:04,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {63250#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {63250#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:21:04,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {63257#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63250#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:21:04,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {63261#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63257#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:21:04,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {63058#true} ~z~0 := ~y~0; {63261#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:21:04,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {63058#true} assume !(~x~0 % 4294967296 > 0); {63058#true} is VALID [2022-04-27 11:21:04,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {63058#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {63058#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {63058#true} call #t~ret17 := main(); {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63058#true} {63058#true} #94#return; {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {63058#true} assume true; {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {63058#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(10, 2);call #Ultimate.allocInit(12, 3); {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {63058#true} call ULTIMATE.init(); {63058#true} is VALID [2022-04-27 11:21:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-04-27 11:21:04,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262001936] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:21:04,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:21:04,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 8] total 33 [2022-04-27 11:21:04,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313961181] [2022-04-27 11:21:04,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:21:04,344 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 32 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 11:21:04,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:21:04,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 32 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:04,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:04,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-27 11:21:04,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:21:04,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-27 11:21:04,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 11:21:04,390 INFO L87 Difference]: Start difference. First operand 768 states and 1066 transitions. Second operand has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 32 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:18,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:18,758 INFO L93 Difference]: Finished difference Result 1311 states and 1889 transitions. [2022-04-27 11:21:18,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-04-27 11:21:18,758 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 32 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 11:21:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:21:18,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 32 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 370 transitions. [2022-04-27 11:21:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 32 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 370 transitions. [2022-04-27 11:21:18,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 370 transitions. [2022-04-27 11:21:19,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:19,145 INFO L225 Difference]: With dead ends: 1311 [2022-04-27 11:21:19,145 INFO L226 Difference]: Without dead ends: 1088 [2022-04-27 11:21:19,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9431 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2421, Invalid=26309, Unknown=0, NotChecked=0, Total=28730 [2022-04-27 11:21:19,147 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 207 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4811 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 5417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 4811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:21:19,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 170 Invalid, 5417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 4811 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-27 11:21:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2022-04-27 11:21:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 766. [2022-04-27 11:21:20,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:21:20,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1088 states. Second operand has 766 states, 761 states have (on average 1.3942181340341655) internal successors, (1061), 761 states have internal predecessors, (1061), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:20,256 INFO L74 IsIncluded]: Start isIncluded. First operand 1088 states. Second operand has 766 states, 761 states have (on average 1.3942181340341655) internal successors, (1061), 761 states have internal predecessors, (1061), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:20,256 INFO L87 Difference]: Start difference. First operand 1088 states. Second operand has 766 states, 761 states have (on average 1.3942181340341655) internal successors, (1061), 761 states have internal predecessors, (1061), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:20,288 INFO L93 Difference]: Finished difference Result 1088 states and 1480 transitions. [2022-04-27 11:21:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1480 transitions. [2022-04-27 11:21:20,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:20,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:20,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 766 states, 761 states have (on average 1.3942181340341655) internal successors, (1061), 761 states have internal predecessors, (1061), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1088 states. [2022-04-27 11:21:20,289 INFO L87 Difference]: Start difference. First operand has 766 states, 761 states have (on average 1.3942181340341655) internal successors, (1061), 761 states have internal predecessors, (1061), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1088 states. [2022-04-27 11:21:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:20,321 INFO L93 Difference]: Finished difference Result 1088 states and 1480 transitions. [2022-04-27 11:21:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1480 transitions. [2022-04-27 11:21:20,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:20,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:20,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:21:20,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:21:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 761 states have (on average 1.3942181340341655) internal successors, (1061), 761 states have internal predecessors, (1061), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1065 transitions. [2022-04-27 11:21:20,340 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1065 transitions. Word has length 39 [2022-04-27 11:21:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:21:20,340 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1065 transitions. [2022-04-27 11:21:20,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 32 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1065 transitions. [2022-04-27 11:21:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 11:21:20,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:21:20,341 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:21:20,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-27 11:21:20,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-27 11:21:20,541 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:21:20,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:21:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1046867033, now seen corresponding path program 7 times [2022-04-27 11:21:20,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:21:20,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760456064] [2022-04-27 11:21:20,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:21:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:21:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:20,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:21:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:20,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {68145#(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(10, 2);call #Ultimate.allocInit(12, 3); {68133#true} is VALID [2022-04-27 11:21:20,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {68133#true} assume true; {68133#true} is VALID [2022-04-27 11:21:20,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68133#true} {68133#true} #94#return; {68133#true} is VALID [2022-04-27 11:21:20,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {68133#true} call ULTIMATE.init(); {68145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:21:20,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {68145#(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(10, 2);call #Ultimate.allocInit(12, 3); {68133#true} is VALID [2022-04-27 11:21:20,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {68133#true} assume true; {68133#true} is VALID [2022-04-27 11:21:20,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68133#true} {68133#true} #94#return; {68133#true} is VALID [2022-04-27 11:21:20,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {68133#true} call #t~ret17 := main(); {68133#true} is VALID [2022-04-27 11:21:20,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {68133#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68133#true} is VALID [2022-04-27 11:21:20,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#true} is VALID [2022-04-27 11:21:20,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#true} is VALID [2022-04-27 11:21:20,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#true} is VALID [2022-04-27 11:21:20,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#true} is VALID [2022-04-27 11:21:20,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {68133#true} assume !(~x~0 % 4294967296 > 0); {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:20,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:20,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:20,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:20,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:20,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:20,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:20,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:20,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:20,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:20,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:20,701 INFO L272 TraceCheckUtils]: 37: Hoare triple {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {68143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:21:20,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {68143#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {68144#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:21:20,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {68144#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {68134#false} is VALID [2022-04-27 11:21:20,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {68134#false} assume !false; {68134#false} is VALID [2022-04-27 11:21:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-27 11:21:20,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:21:20,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760456064] [2022-04-27 11:21:20,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760456064] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:21:20,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920848337] [2022-04-27 11:21:20,702 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:21:20,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:20,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:21:20,703 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:21:20,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-27 11:21:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:20,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-27 11:21:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:20,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:21:21,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {68133#true} call ULTIMATE.init(); {68133#true} is VALID [2022-04-27 11:21:21,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {68133#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(10, 2);call #Ultimate.allocInit(12, 3); {68133#true} is VALID [2022-04-27 11:21:21,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {68133#true} assume true; {68133#true} is VALID [2022-04-27 11:21:21,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68133#true} {68133#true} #94#return; {68133#true} is VALID [2022-04-27 11:21:21,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {68133#true} call #t~ret17 := main(); {68133#true} is VALID [2022-04-27 11:21:21,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {68133#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68133#true} is VALID [2022-04-27 11:21:21,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#true} is VALID [2022-04-27 11:21:21,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#true} is VALID [2022-04-27 11:21:21,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#true} is VALID [2022-04-27 11:21:21,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#true} is VALID [2022-04-27 11:21:21,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {68133#true} assume !(~x~0 % 4294967296 > 0); {68133#true} is VALID [2022-04-27 11:21:21,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {68133#true} ~z~0 := ~y~0; {68133#true} is VALID [2022-04-27 11:21:21,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {68133#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68133#true} is VALID [2022-04-27 11:21:21,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {68133#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68133#true} is VALID [2022-04-27 11:21:21,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {68133#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68133#true} is VALID [2022-04-27 11:21:21,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {68133#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68133#true} is VALID [2022-04-27 11:21:21,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {68133#true} assume !(~z~0 % 4294967296 > 0); {68133#true} is VALID [2022-04-27 11:21:21,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {68133#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68133#true} is VALID [2022-04-27 11:21:21,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {68133#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68133#true} is VALID [2022-04-27 11:21:21,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {68133#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68133#true} is VALID [2022-04-27 11:21:21,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {68133#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68133#true} is VALID [2022-04-27 11:21:21,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {68133#true} assume !(~y~0 % 4294967296 > 0); {68133#true} is VALID [2022-04-27 11:21:21,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68133#true} is VALID [2022-04-27 11:21:21,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68133#true} is VALID [2022-04-27 11:21:21,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68133#true} is VALID [2022-04-27 11:21:21,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68133#true} is VALID [2022-04-27 11:21:21,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {68133#true} assume !(~x~0 % 4294967296 > 0); {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:21,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:21,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:21,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:21,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:21,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:21,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:21,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:21,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:21,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:21,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:21,018 INFO L272 TraceCheckUtils]: 37: Hoare triple {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {68260#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:21:21,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {68260#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {68264#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:21:21,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {68264#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {68134#false} is VALID [2022-04-27 11:21:21,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {68134#false} assume !false; {68134#false} is VALID [2022-04-27 11:21:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 11:21:21,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:21:21,177 INFO L290 TraceCheckUtils]: 40: Hoare triple {68134#false} assume !false; {68134#false} is VALID [2022-04-27 11:21:21,178 INFO L290 TraceCheckUtils]: 39: Hoare triple {68264#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {68134#false} is VALID [2022-04-27 11:21:21,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {68260#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {68264#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:21:21,179 INFO L272 TraceCheckUtils]: 37: Hoare triple {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {68260#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:21:21,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:21,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:21,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:21,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:21,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:21,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:21,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68142#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:21,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68141#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:21,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68140#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:21:21,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68139#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:21:21,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {68133#true} assume !(~x~0 % 4294967296 > 0); {68138#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {68133#true} assume !(~y~0 % 4294967296 > 0); {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {68133#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {68133#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {68133#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {68133#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {68133#true} assume !(~z~0 % 4294967296 > 0); {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {68133#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {68133#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {68133#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {68133#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {68133#true} ~z~0 := ~y~0; {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {68133#true} assume !(~x~0 % 4294967296 > 0); {68133#true} is VALID [2022-04-27 11:21:21,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#true} is VALID [2022-04-27 11:21:21,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#true} is VALID [2022-04-27 11:21:21,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#true} is VALID [2022-04-27 11:21:21,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {68133#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68133#true} is VALID [2022-04-27 11:21:21,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {68133#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68133#true} is VALID [2022-04-27 11:21:21,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {68133#true} call #t~ret17 := main(); {68133#true} is VALID [2022-04-27 11:21:21,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68133#true} {68133#true} #94#return; {68133#true} is VALID [2022-04-27 11:21:21,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {68133#true} assume true; {68133#true} is VALID [2022-04-27 11:21:21,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {68133#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(10, 2);call #Ultimate.allocInit(12, 3); {68133#true} is VALID [2022-04-27 11:21:21,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {68133#true} call ULTIMATE.init(); {68133#true} is VALID [2022-04-27 11:21:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 11:21:21,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920848337] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:21:21,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:21:21,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-04-27 11:21:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675772533] [2022-04-27 11:21:21,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:21:21,190 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 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:21:21,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:21:21,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:21,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:21,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 11:21:21,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:21:21,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 11:21:21,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:21:21,230 INFO L87 Difference]: Start difference. First operand 766 states and 1065 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:23,356 INFO L93 Difference]: Finished difference Result 1256 states and 1687 transitions. [2022-04-27 11:21:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:21:23,356 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 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:21:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:21:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2022-04-27 11:21:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2022-04-27 11:21:23,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 83 transitions. [2022-04-27 11:21:23,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:23,455 INFO L225 Difference]: With dead ends: 1256 [2022-04-27 11:21:23,455 INFO L226 Difference]: Without dead ends: 1052 [2022-04-27 11:21:23,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:21:23,456 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 43 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:21:23,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 85 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:21:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-04-27 11:21:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 746. [2022-04-27 11:21:24,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:21:24,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1052 states. Second operand has 746 states, 741 states have (on average 1.388663967611336) internal successors, (1029), 741 states have internal predecessors, (1029), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:24,494 INFO L74 IsIncluded]: Start isIncluded. First operand 1052 states. Second operand has 746 states, 741 states have (on average 1.388663967611336) internal successors, (1029), 741 states have internal predecessors, (1029), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:24,495 INFO L87 Difference]: Start difference. First operand 1052 states. Second operand has 746 states, 741 states have (on average 1.388663967611336) internal successors, (1029), 741 states have internal predecessors, (1029), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:24,525 INFO L93 Difference]: Finished difference Result 1052 states and 1403 transitions. [2022-04-27 11:21:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1403 transitions. [2022-04-27 11:21:24,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:24,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:24,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 746 states, 741 states have (on average 1.388663967611336) internal successors, (1029), 741 states have internal predecessors, (1029), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1052 states. [2022-04-27 11:21:24,527 INFO L87 Difference]: Start difference. First operand has 746 states, 741 states have (on average 1.388663967611336) internal successors, (1029), 741 states have internal predecessors, (1029), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1052 states. [2022-04-27 11:21:24,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:24,558 INFO L93 Difference]: Finished difference Result 1052 states and 1403 transitions. [2022-04-27 11:21:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1403 transitions. [2022-04-27 11:21:24,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:24,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:24,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:21:24,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:21:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 741 states have (on average 1.388663967611336) internal successors, (1029), 741 states have internal predecessors, (1029), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1033 transitions. [2022-04-27 11:21:24,575 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1033 transitions. Word has length 41 [2022-04-27 11:21:24,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:21:24,575 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 1033 transitions. [2022-04-27 11:21:24,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1033 transitions. [2022-04-27 11:21:24,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 11:21:24,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:21:24,576 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:21:24,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-27 11:21:24,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:24,780 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:21:24,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:21:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1628968459, now seen corresponding path program 8 times [2022-04-27 11:21:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:21:24,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809782240] [2022-04-27 11:21:24,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:21:24,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:21:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:25,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:21:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:25,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {72801#(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(10, 2);call #Ultimate.allocInit(12, 3); {72779#true} is VALID [2022-04-27 11:21:25,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {72779#true} assume true; {72779#true} is VALID [2022-04-27 11:21:25,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72779#true} {72779#true} #94#return; {72779#true} is VALID [2022-04-27 11:21:25,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {72779#true} call ULTIMATE.init(); {72801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:21:25,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {72801#(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(10, 2);call #Ultimate.allocInit(12, 3); {72779#true} is VALID [2022-04-27 11:21:25,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {72779#true} assume true; {72779#true} is VALID [2022-04-27 11:21:25,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72779#true} {72779#true} #94#return; {72779#true} is VALID [2022-04-27 11:21:25,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {72779#true} call #t~ret17 := main(); {72779#true} is VALID [2022-04-27 11:21:25,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {72779#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72784#(= main_~y~0 0)} is VALID [2022-04-27 11:21:25,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {72784#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72785#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:21:25,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {72785#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72786#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:21:25,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {72786#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72787#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:21:25,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {72787#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72788#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:21:25,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {72788#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72789#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:21:25,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {72789#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72790#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:25,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {72790#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72791#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:21:25,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {72791#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72792#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:21:25,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {72792#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {72792#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:21:25,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {72792#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {72793#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:21:25,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {72793#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72794#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:21:25,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {72794#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72795#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:21:25,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {72795#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72796#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:21:25,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {72796#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72797#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:21:25,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {72797#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72798#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:21:25,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {72798#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72799#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:21:25,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {72799#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72800#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:21:25,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {72800#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {72780#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {72780#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {72780#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {72780#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {72780#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {72780#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {72780#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {72780#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {72780#false} assume !(~y~0 % 4294967296 > 0); {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {72780#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {72780#false} assume !(~x~0 % 4294967296 > 0); {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {72780#false} assume !(~z~0 % 4294967296 > 0); {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {72780#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {72780#false} assume !(~y~0 % 4294967296 > 0); {72780#false} is VALID [2022-04-27 11:21:25,066 INFO L272 TraceCheckUtils]: 38: Hoare triple {72780#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {72780#false} is VALID [2022-04-27 11:21:25,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {72780#false} ~cond := #in~cond; {72780#false} is VALID [2022-04-27 11:21:25,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {72780#false} assume 0 == ~cond; {72780#false} is VALID [2022-04-27 11:21:25,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {72780#false} assume !false; {72780#false} is VALID [2022-04-27 11:21:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 11:21:25,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:21:25,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809782240] [2022-04-27 11:21:25,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809782240] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:21:25,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535999497] [2022-04-27 11:21:25,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:21:25,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:25,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:21:25,080 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:21:25,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-27 11:21:25,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:21:25,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:21:25,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 11:21:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:25,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:21:25,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {72779#true} call ULTIMATE.init(); {72779#true} is VALID [2022-04-27 11:21:25,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {72779#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(10, 2);call #Ultimate.allocInit(12, 3); {72779#true} is VALID [2022-04-27 11:21:25,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {72779#true} assume true; {72779#true} is VALID [2022-04-27 11:21:25,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72779#true} {72779#true} #94#return; {72779#true} is VALID [2022-04-27 11:21:25,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {72779#true} call #t~ret17 := main(); {72779#true} is VALID [2022-04-27 11:21:25,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {72779#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72779#true} is VALID [2022-04-27 11:21:25,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {72779#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72779#true} is VALID [2022-04-27 11:21:25,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {72779#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72779#true} is VALID [2022-04-27 11:21:25,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {72779#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72829#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:21:25,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {72829#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72833#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:21:25,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {72833#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72837#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:21:25,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {72837#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72841#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:21:25,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {72841#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72845#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:21:25,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {72845#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72849#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:21:25,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {72849#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {72849#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:21:25,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {72849#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {72849#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:21:25,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {72849#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72845#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:21:25,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {72845#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72841#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:21:25,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {72841#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72837#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:21:25,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {72837#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72833#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:21:25,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {72833#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72829#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:21:25,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {72829#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72874#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:21:25,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {72874#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {72874#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:21:25,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {72874#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {72780#false} is VALID [2022-04-27 11:21:25,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {72780#false} assume !(~z~0 % 4294967296 > 0); {72780#false} is VALID [2022-04-27 11:21:25,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {72780#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {72780#false} is VALID [2022-04-27 11:21:25,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {72780#false} assume !(~y~0 % 4294967296 > 0); {72780#false} is VALID [2022-04-27 11:21:25,414 INFO L272 TraceCheckUtils]: 38: Hoare triple {72780#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {72780#false} is VALID [2022-04-27 11:21:25,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {72780#false} ~cond := #in~cond; {72780#false} is VALID [2022-04-27 11:21:25,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {72780#false} assume 0 == ~cond; {72780#false} is VALID [2022-04-27 11:21:25,415 INFO L290 TraceCheckUtils]: 41: Hoare triple {72780#false} assume !false; {72780#false} is VALID [2022-04-27 11:21:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 18 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 11:21:25,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:21:25,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {72780#false} assume !false; {72780#false} is VALID [2022-04-27 11:21:25,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {72780#false} assume 0 == ~cond; {72780#false} is VALID [2022-04-27 11:21:25,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {72780#false} ~cond := #in~cond; {72780#false} is VALID [2022-04-27 11:21:25,539 INFO L272 TraceCheckUtils]: 38: Hoare triple {72780#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {72780#false} is VALID [2022-04-27 11:21:25,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {72780#false} assume !(~y~0 % 4294967296 > 0); {72780#false} is VALID [2022-04-27 11:21:25,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {72780#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {72780#false} is VALID [2022-04-27 11:21:25,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {72780#false} assume !(~z~0 % 4294967296 > 0); {72780#false} is VALID [2022-04-27 11:21:25,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {72874#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {72780#false} is VALID [2022-04-27 11:21:25,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {72874#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:21:25,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {72874#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72878#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:25,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {72829#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72874#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:21:25,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {72833#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72829#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:21:25,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {72837#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72833#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:21:25,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {72841#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72837#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:21:25,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {72845#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72841#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:21:25,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {72849#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72845#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:21:25,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {72849#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {72849#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:21:25,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {72849#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {72849#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:21:25,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {72845#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72849#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:21:25,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {72841#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72845#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:21:25,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {72837#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72841#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:21:25,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {72833#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72837#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:21:25,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {72829#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72833#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:21:25,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {72779#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72829#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:21:25,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {72779#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72779#true} is VALID [2022-04-27 11:21:25,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {72779#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {72779#true} is VALID [2022-04-27 11:21:25,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {72779#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72779#true} is VALID [2022-04-27 11:21:25,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {72779#true} call #t~ret17 := main(); {72779#true} is VALID [2022-04-27 11:21:25,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72779#true} {72779#true} #94#return; {72779#true} is VALID [2022-04-27 11:21:25,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {72779#true} assume true; {72779#true} is VALID [2022-04-27 11:21:25,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {72779#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(10, 2);call #Ultimate.allocInit(12, 3); {72779#true} is VALID [2022-04-27 11:21:25,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {72779#true} call ULTIMATE.init(); {72779#true} is VALID [2022-04-27 11:21:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 18 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 11:21:25,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535999497] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:21:25,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:21:25,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-27 11:21:25,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859155595] [2022-04-27 11:21:25,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:21:25,565 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-27 11:21:25,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:21:25,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:25,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:25,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 11:21:25,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:21:25,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 11:21:25,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:21:25,603 INFO L87 Difference]: Start difference. First operand 746 states and 1033 transitions. Second operand has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:22:34,901 INFO L93 Difference]: Finished difference Result 2257 states and 2893 transitions. [2022-04-27 11:22:34,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 332 states. [2022-04-27 11:22:34,901 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-27 11:22:34,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:22:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 782 transitions. [2022-04-27 11:22:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 782 transitions. [2022-04-27 11:22:34,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 332 states and 782 transitions. [2022-04-27 11:22:37,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 782 edges. 782 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:22:37,205 INFO L225 Difference]: With dead ends: 2257 [2022-04-27 11:22:37,205 INFO L226 Difference]: Without dead ends: 2122 [2022-04-27 11:22:37,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54736 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=7646, Invalid=119446, Unknown=0, NotChecked=0, Total=127092 [2022-04-27 11:22:37,211 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 504 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4284 mSolverCounterSat, 847 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 5131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 847 IncrementalHoareTripleChecker+Valid, 4284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:22:37,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 187 Invalid, 5131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [847 Valid, 4284 Invalid, 0 Unknown, 0 Unchecked, 20.5s Time] [2022-04-27 11:22:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2022-04-27 11:22:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 743. [2022-04-27 11:22:38,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:22:38,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2122 states. Second operand has 743 states, 738 states have (on average 1.3848238482384825) internal successors, (1022), 738 states have internal predecessors, (1022), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:38,237 INFO L74 IsIncluded]: Start isIncluded. First operand 2122 states. Second operand has 743 states, 738 states have (on average 1.3848238482384825) internal successors, (1022), 738 states have internal predecessors, (1022), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:38,237 INFO L87 Difference]: Start difference. First operand 2122 states. Second operand has 743 states, 738 states have (on average 1.3848238482384825) internal successors, (1022), 738 states have internal predecessors, (1022), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:22:38,363 INFO L93 Difference]: Finished difference Result 2122 states and 2677 transitions. [2022-04-27 11:22:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2677 transitions. [2022-04-27 11:22:38,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:22:38,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:22:38,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 743 states, 738 states have (on average 1.3848238482384825) internal successors, (1022), 738 states have internal predecessors, (1022), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2122 states. [2022-04-27 11:22:38,366 INFO L87 Difference]: Start difference. First operand has 743 states, 738 states have (on average 1.3848238482384825) internal successors, (1022), 738 states have internal predecessors, (1022), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2122 states. [2022-04-27 11:22:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:22:38,486 INFO L93 Difference]: Finished difference Result 2122 states and 2677 transitions. [2022-04-27 11:22:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2677 transitions. [2022-04-27 11:22:38,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:22:38,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:22:38,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:22:38,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:22:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 738 states have (on average 1.3848238482384825) internal successors, (1022), 738 states have internal predecessors, (1022), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1026 transitions. [2022-04-27 11:22:38,505 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1026 transitions. Word has length 42 [2022-04-27 11:22:38,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:22:38,505 INFO L495 AbstractCegarLoop]: Abstraction has 743 states and 1026 transitions. [2022-04-27 11:22:38,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1026 transitions. [2022-04-27 11:22:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 11:22:38,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:22:38,506 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:22:38,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-27 11:22:38,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-27 11:22:38,707 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:22:38,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:22:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash -209000572, now seen corresponding path program 9 times [2022-04-27 11:22:38,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:22:38,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814782533] [2022-04-27 11:22:38,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:22:38,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:22:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:22:39,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:22:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:22:39,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {81322#(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(10, 2);call #Ultimate.allocInit(12, 3); {81298#true} is VALID [2022-04-27 11:22:39,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {81298#true} assume true; {81298#true} is VALID [2022-04-27 11:22:39,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81298#true} {81298#true} #94#return; {81298#true} is VALID [2022-04-27 11:22:39,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {81298#true} call ULTIMATE.init(); {81322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:22:39,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {81322#(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(10, 2);call #Ultimate.allocInit(12, 3); {81298#true} is VALID [2022-04-27 11:22:39,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {81298#true} assume true; {81298#true} is VALID [2022-04-27 11:22:39,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81298#true} {81298#true} #94#return; {81298#true} is VALID [2022-04-27 11:22:39,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {81298#true} call #t~ret17 := main(); {81298#true} is VALID [2022-04-27 11:22:39,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {81298#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81303#(= main_~y~0 0)} is VALID [2022-04-27 11:22:39,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {81303#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81304#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:22:39,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {81304#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81305#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:22:39,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {81305#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81306#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:22:39,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {81306#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81307#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:22:39,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {81307#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81308#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:22:39,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {81308#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81309#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:22:39,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {81309#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81310#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:22:39,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {81310#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81311#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:22:39,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {81311#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {81311#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:22:39,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {81311#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {81312#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:22:39,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {81312#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81313#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:22:39,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {81313#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81314#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:22:39,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {81314#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81315#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:22:39,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {81315#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81316#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:22:39,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {81316#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81317#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:22:39,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {81317#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81318#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:22:39,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {81318#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81319#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:22:39,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {81319#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81320#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:22:39,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {81320#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {81320#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:22:39,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {81320#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81319#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:22:39,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {81319#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81318#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:22:39,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {81318#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81317#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:22:39,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {81317#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81316#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:22:39,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {81316#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81315#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:22:39,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {81315#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81314#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:22:39,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {81314#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81313#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:22:39,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {81313#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81312#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:22:39,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {81312#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~y~0 % 4294967296 > 0); {81312#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:22:39,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {81312#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~x~0 % 4294967296 > 0); {81312#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:22:39,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {81312#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {81321#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:22:39,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {81321#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {81299#false} is VALID [2022-04-27 11:22:39,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {81299#false} assume !(~y~0 % 4294967296 > 0); {81299#false} is VALID [2022-04-27 11:22:39,064 INFO L272 TraceCheckUtils]: 38: Hoare triple {81299#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {81299#false} is VALID [2022-04-27 11:22:39,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {81299#false} ~cond := #in~cond; {81299#false} is VALID [2022-04-27 11:22:39,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {81299#false} assume 0 == ~cond; {81299#false} is VALID [2022-04-27 11:22:39,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {81299#false} assume !false; {81299#false} is VALID [2022-04-27 11:22:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:22:39,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:22:39,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814782533] [2022-04-27 11:22:39,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814782533] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:22:39,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367463118] [2022-04-27 11:22:39,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:22:39,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:22:39,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:22:39,066 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:22:39,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-27 11:22:39,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-04-27 11:22:39,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:22:39,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-27 11:22:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:22:39,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:22:39,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {81298#true} call ULTIMATE.init(); {81298#true} is VALID [2022-04-27 11:22:39,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {81298#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(10, 2);call #Ultimate.allocInit(12, 3); {81298#true} is VALID [2022-04-27 11:22:39,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {81298#true} assume true; {81298#true} is VALID [2022-04-27 11:22:39,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81298#true} {81298#true} #94#return; {81298#true} is VALID [2022-04-27 11:22:39,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {81298#true} call #t~ret17 := main(); {81298#true} is VALID [2022-04-27 11:22:39,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {81298#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81298#true} is VALID [2022-04-27 11:22:39,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {81298#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81344#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:22:39,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {81344#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81348#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:22:39,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {81348#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81352#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:22:39,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {81352#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81356#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:22:39,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {81356#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81360#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:22:39,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {81360#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81364#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:22:39,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {81364#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81368#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:22:39,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {81368#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81372#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:22:39,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {81372#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {81372#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:22:39,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {81372#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {81372#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:22:39,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {81372#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81368#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:22:39,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {81368#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81364#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:22:39,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {81364#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81360#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:22:39,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {81360#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81356#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:22:39,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {81356#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81352#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:22:39,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {81352#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81348#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:22:39,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {81348#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81344#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:22:39,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {81344#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {81299#false} is VALID [2022-04-27 11:22:39,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {81299#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {81299#false} is VALID [2022-04-27 11:22:39,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {81299#false} assume !(~z~0 % 4294967296 > 0); {81299#false} is VALID [2022-04-27 11:22:39,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {81299#false} assume !(~y~0 % 4294967296 > 0); {81299#false} is VALID [2022-04-27 11:22:39,504 INFO L272 TraceCheckUtils]: 38: Hoare triple {81299#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {81299#false} is VALID [2022-04-27 11:22:39,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {81299#false} ~cond := #in~cond; {81299#false} is VALID [2022-04-27 11:22:39,504 INFO L290 TraceCheckUtils]: 40: Hoare triple {81299#false} assume 0 == ~cond; {81299#false} is VALID [2022-04-27 11:22:39,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {81299#false} assume !false; {81299#false} is VALID [2022-04-27 11:22:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-27 11:22:39,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:22:39,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {81299#false} assume !false; {81299#false} is VALID [2022-04-27 11:22:39,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {81299#false} assume 0 == ~cond; {81299#false} is VALID [2022-04-27 11:22:39,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {81299#false} ~cond := #in~cond; {81299#false} is VALID [2022-04-27 11:22:39,639 INFO L272 TraceCheckUtils]: 38: Hoare triple {81299#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {81299#false} is VALID [2022-04-27 11:22:39,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {81299#false} assume !(~y~0 % 4294967296 > 0); {81299#false} is VALID [2022-04-27 11:22:39,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {81299#false} assume !(~z~0 % 4294967296 > 0); {81299#false} is VALID [2022-04-27 11:22:39,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {81299#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {81299#false} is VALID [2022-04-27 11:22:39,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {81299#false} is VALID [2022-04-27 11:22:39,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {81403#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {81344#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81403#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:22:39,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {81348#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81344#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:22:39,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {81352#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81348#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:22:39,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {81356#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81352#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:22:39,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {81360#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81356#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:22:39,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {81364#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81360#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:22:39,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {81368#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81364#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:22:39,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {81372#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81368#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:22:39,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {81372#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {81372#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:22:39,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {81372#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {81372#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:22:39,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {81368#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81372#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:22:39,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {81364#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81368#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:22:39,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {81360#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81364#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:22:39,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {81356#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81360#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:22:39,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {81352#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81356#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:22:39,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {81348#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81352#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:22:39,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {81344#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81348#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:22:39,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {81298#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81344#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:22:39,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {81298#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81298#true} is VALID [2022-04-27 11:22:39,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {81298#true} call #t~ret17 := main(); {81298#true} is VALID [2022-04-27 11:22:39,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81298#true} {81298#true} #94#return; {81298#true} is VALID [2022-04-27 11:22:39,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {81298#true} assume true; {81298#true} is VALID [2022-04-27 11:22:39,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {81298#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(10, 2);call #Ultimate.allocInit(12, 3); {81298#true} is VALID [2022-04-27 11:22:39,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {81298#true} call ULTIMATE.init(); {81298#true} is VALID [2022-04-27 11:22:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-27 11:22:39,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367463118] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:22:39,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:22:39,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 31 [2022-04-27 11:22:39,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553732488] [2022-04-27 11:22:39,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:22:39,654 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-27 11:22:39,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:22:39,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:39,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:22:39,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-27 11:22:39,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:22:39,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-27 11:22:39,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:22:39,715 INFO L87 Difference]: Start difference. First operand 743 states and 1026 transitions. Second operand has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:26:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:26:00,837 INFO L93 Difference]: Finished difference Result 2614 states and 3453 transitions. [2022-04-27 11:26:00,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 491 states. [2022-04-27 11:26:00,837 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-27 11:26:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:26:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:26:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 974 transitions. [2022-04-27 11:26:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:26:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 974 transitions. [2022-04-27 11:26:00,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 491 states and 974 transitions. [2022-04-27 11:26:04,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 974 edges. 974 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:26:04,941 INFO L225 Difference]: With dead ends: 2614 [2022-04-27 11:26:04,941 INFO L226 Difference]: Without dead ends: 2495 [2022-04-27 11:26:04,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 517 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120966 ImplicationChecksByTransitivity, 89.9s TimeCoverageRelationStatistics Valid=13139, Invalid=255703, Unknown=0, NotChecked=0, Total=268842 [2022-04-27 11:26:04,955 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 621 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 6701 mSolverCounterSat, 1525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 8226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1525 IncrementalHoareTripleChecker+Valid, 6701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:26:04,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 176 Invalid, 8226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1525 Valid, 6701 Invalid, 0 Unknown, 0 Unchecked, 53.3s Time] [2022-04-27 11:26:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2022-04-27 11:26:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 847. [2022-04-27 11:26:06,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:26:06,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2495 states. Second operand has 847 states, 842 states have (on average 1.3764845605700713) internal successors, (1159), 842 states have internal predecessors, (1159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:26:06,095 INFO L74 IsIncluded]: Start isIncluded. First operand 2495 states. Second operand has 847 states, 842 states have (on average 1.3764845605700713) internal successors, (1159), 842 states have internal predecessors, (1159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:26:06,096 INFO L87 Difference]: Start difference. First operand 2495 states. Second operand has 847 states, 842 states have (on average 1.3764845605700713) internal successors, (1159), 842 states have internal predecessors, (1159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:26:06,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:26:06,250 INFO L93 Difference]: Finished difference Result 2495 states and 3111 transitions. [2022-04-27 11:26:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3111 transitions. [2022-04-27 11:26:06,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:26:06,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:26:06,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 847 states, 842 states have (on average 1.3764845605700713) internal successors, (1159), 842 states have internal predecessors, (1159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2495 states. [2022-04-27 11:26:06,254 INFO L87 Difference]: Start difference. First operand has 847 states, 842 states have (on average 1.3764845605700713) internal successors, (1159), 842 states have internal predecessors, (1159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2495 states. [2022-04-27 11:26:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:26:06,412 INFO L93 Difference]: Finished difference Result 2495 states and 3111 transitions. [2022-04-27 11:26:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3111 transitions. [2022-04-27 11:26:06,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:26:06,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:26:06,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:26:06,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:26:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 842 states have (on average 1.3764845605700713) internal successors, (1159), 842 states have internal predecessors, (1159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:26:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1163 transitions. [2022-04-27 11:26:06,437 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1163 transitions. Word has length 42 [2022-04-27 11:26:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:26:06,437 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 1163 transitions. [2022-04-27 11:26:06,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:26:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1163 transitions. [2022-04-27 11:26:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 11:26:06,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:26:06,438 INFO L195 NwaCegarLoop]: trace histogram [14, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:26:06,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-27 11:26:06,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:26:06,638 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:26:06,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:26:06,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1181670180, now seen corresponding path program 8 times [2022-04-27 11:26:06,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:26:06,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079168644] [2022-04-27 11:26:06,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:26:06,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:26:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:26:06,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:26:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:26:06,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {91393#(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(10, 2);call #Ultimate.allocInit(12, 3); {91370#true} is VALID [2022-04-27 11:26:06,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {91370#true} assume true; {91370#true} is VALID [2022-04-27 11:26:06,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91370#true} {91370#true} #94#return; {91370#true} is VALID [2022-04-27 11:26:06,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {91370#true} call ULTIMATE.init(); {91393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:26:06,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {91393#(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(10, 2);call #Ultimate.allocInit(12, 3); {91370#true} is VALID [2022-04-27 11:26:06,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {91370#true} assume true; {91370#true} is VALID [2022-04-27 11:26:06,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91370#true} {91370#true} #94#return; {91370#true} is VALID [2022-04-27 11:26:06,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {91370#true} call #t~ret17 := main(); {91370#true} is VALID [2022-04-27 11:26:06,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {91370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91375#(= main_~y~0 0)} is VALID [2022-04-27 11:26:06,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {91375#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:26:06,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {91376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91377#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:26:06,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {91377#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91378#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:26:06,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {91378#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91379#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:26:06,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {91379#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91380#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:26:06,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {91380#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91381#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:26:06,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {91381#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91382#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:26:06,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {91382#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91383#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:26:06,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {91383#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91384#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:26:06,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {91384#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91385#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:26:06,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {91385#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:26:06,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {91386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91387#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:26:06,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {91387#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:26:06,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {91388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91389#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:26:06,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {91389#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {91389#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:26:06,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {91389#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:26:06,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91391#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:26:06,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {91391#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91392#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-27 11:26:06,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {91392#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {91371#false} is VALID [2022-04-27 11:26:06,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {91371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91371#false} is VALID [2022-04-27 11:26:06,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {91371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91371#false} is VALID [2022-04-27 11:26:06,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {91371#false} assume !(~y~0 % 4294967296 > 0); {91371#false} is VALID [2022-04-27 11:26:06,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {91371#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {91371#false} is VALID [2022-04-27 11:26:06,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {91371#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {91371#false} is VALID [2022-04-27 11:26:06,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {91371#false} assume !(~x~0 % 4294967296 > 0); {91371#false} is VALID [2022-04-27 11:26:06,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {91371#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91371#false} is VALID [2022-04-27 11:26:06,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {91371#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91371#false} is VALID [2022-04-27 11:26:06,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {91371#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91371#false} is VALID [2022-04-27 11:26:06,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {91371#false} assume !(~z~0 % 4294967296 > 0); {91371#false} is VALID [2022-04-27 11:26:06,931 INFO L290 TraceCheckUtils]: 35: Hoare triple {91371#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {91371#false} is VALID [2022-04-27 11:26:06,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {91371#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {91371#false} is VALID [2022-04-27 11:26:06,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {91371#false} assume !(~y~0 % 4294967296 > 0); {91371#false} is VALID [2022-04-27 11:26:06,931 INFO L272 TraceCheckUtils]: 38: Hoare triple {91371#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {91371#false} is VALID [2022-04-27 11:26:06,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {91371#false} ~cond := #in~cond; {91371#false} is VALID [2022-04-27 11:26:06,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {91371#false} assume 0 == ~cond; {91371#false} is VALID [2022-04-27 11:26:06,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {91371#false} assume !false; {91371#false} is VALID [2022-04-27 11:26:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:26:06,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:26:06,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079168644] [2022-04-27 11:26:06,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079168644] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:26:06,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303796738] [2022-04-27 11:26:06,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:26:06,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:26:06,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:26:06,935 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:26:06,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-27 11:26:06,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:26:06,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:26:06,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 11:26:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:26:06,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:26:07,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {91370#true} call ULTIMATE.init(); {91370#true} is VALID [2022-04-27 11:26:07,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {91370#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(10, 2);call #Ultimate.allocInit(12, 3); {91370#true} is VALID [2022-04-27 11:26:07,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {91370#true} assume true; {91370#true} is VALID [2022-04-27 11:26:07,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91370#true} {91370#true} #94#return; {91370#true} is VALID [2022-04-27 11:26:07,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {91370#true} call #t~ret17 := main(); {91370#true} is VALID [2022-04-27 11:26:07,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {91370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91375#(= main_~y~0 0)} is VALID [2022-04-27 11:26:07,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {91375#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:26:07,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {91376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91377#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:26:07,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {91377#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91378#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:26:07,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {91378#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91379#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:26:07,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {91379#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91380#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:26:07,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {91380#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91381#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:26:07,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {91381#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91382#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:26:07,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {91382#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91383#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:26:07,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {91383#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91384#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:26:07,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {91384#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91385#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:26:07,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {91385#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:26:07,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {91386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91387#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:26:07,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {91387#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:26:07,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {91388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91389#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:26:07,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {91389#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {91389#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:26:07,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {91389#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:26:07,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91391#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:26:07,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {91391#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91466#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:26:07,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {91466#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {91466#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:26:07,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {91466#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91391#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:26:07,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {91391#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:26:07,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~y~0 % 4294967296 > 0); {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:26:07,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:26:07,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:26:07,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~x~0 % 4294967296 > 0); {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:26:07,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {91390#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91391#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:26:07,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {91391#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91466#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:26:07,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {91466#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91497#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:26:07,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {91497#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {91371#false} is VALID [2022-04-27 11:26:07,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {91371#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {91371#false} is VALID [2022-04-27 11:26:07,378 INFO L290 TraceCheckUtils]: 36: Hoare triple {91371#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {91371#false} is VALID [2022-04-27 11:26:07,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {91371#false} assume !(~y~0 % 4294967296 > 0); {91371#false} is VALID [2022-04-27 11:26:07,378 INFO L272 TraceCheckUtils]: 38: Hoare triple {91371#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {91371#false} is VALID [2022-04-27 11:26:07,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {91371#false} ~cond := #in~cond; {91371#false} is VALID [2022-04-27 11:26:07,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {91371#false} assume 0 == ~cond; {91371#false} is VALID [2022-04-27 11:26:07,379 INFO L290 TraceCheckUtils]: 41: Hoare triple {91371#false} assume !false; {91371#false} is VALID [2022-04-27 11:26:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:26:07,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:26:07,961 INFO L290 TraceCheckUtils]: 41: Hoare triple {91371#false} assume !false; {91371#false} is VALID [2022-04-27 11:26:07,961 INFO L290 TraceCheckUtils]: 40: Hoare triple {91371#false} assume 0 == ~cond; {91371#false} is VALID [2022-04-27 11:26:07,961 INFO L290 TraceCheckUtils]: 39: Hoare triple {91371#false} ~cond := #in~cond; {91371#false} is VALID [2022-04-27 11:26:07,961 INFO L272 TraceCheckUtils]: 38: Hoare triple {91371#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {91371#false} is VALID [2022-04-27 11:26:07,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {91371#false} assume !(~y~0 % 4294967296 > 0); {91371#false} is VALID [2022-04-27 11:26:07,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {91371#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {91371#false} is VALID [2022-04-27 11:26:07,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {91371#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {91371#false} is VALID [2022-04-27 11:26:07,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {91543#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {91371#false} is VALID [2022-04-27 11:26:07,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {91547#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91543#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:26:07,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {91551#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91547#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:26:07,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {91555#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {91551#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:26:07,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {91555#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {91555#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:26:07,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {91555#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {91555#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:26:07,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {91555#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {91555#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:26:07,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {91555#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !(~y~0 % 4294967296 > 0); {91555#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:26:07,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {91551#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91555#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:26:07,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {91547#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91551#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:26:07,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {91547#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {91547#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:26:07,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {91551#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91547#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:26:07,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {91555#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91551#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:26:07,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {91586#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {91555#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:26:07,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {91586#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {91586#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:26:07,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {91593#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91586#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:26:07,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {91597#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91593#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:26:07,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {91601#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91597#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:26:07,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {91605#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91601#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:26:07,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {91609#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91605#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:26:07,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {91613#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91609#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:26:07,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {91617#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91613#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:26:07,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {91621#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91617#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:26:07,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {91625#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91621#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:26:07,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {91629#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91625#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:26:07,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {91633#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91629#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:26:07,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {91637#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91633#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:26:07,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {91641#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91637#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:26:07,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {91645#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91641#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:26:07,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {91370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91645#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:26:07,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {91370#true} call #t~ret17 := main(); {91370#true} is VALID [2022-04-27 11:26:07,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91370#true} {91370#true} #94#return; {91370#true} is VALID [2022-04-27 11:26:07,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {91370#true} assume true; {91370#true} is VALID [2022-04-27 11:26:07,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {91370#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(10, 2);call #Ultimate.allocInit(12, 3); {91370#true} is VALID [2022-04-27 11:26:07,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {91370#true} call ULTIMATE.init(); {91370#true} is VALID [2022-04-27 11:26:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:26:07,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303796738] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:26:07,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:26:07,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2022-04-27 11:26:07,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654145350] [2022-04-27 11:26:07,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:26:07,980 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 41 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-27 11:26:07,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:26:07,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 41 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:26:08,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:26:08,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-27 11:26:08,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:26:08,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-27 11:26:08,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 11:26:08,031 INFO L87 Difference]: Start difference. First operand 847 states and 1163 transitions. Second operand has 42 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 41 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:26:23,519 WARN L232 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:26:33,098 WARN L232 SmtUtils]: Spent 6.62s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:26:58,130 WARN L232 SmtUtils]: Spent 15.52s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:27:10,393 WARN L833 $PredicateComparison]: unable to prove that (and (< 0 (mod (+ 2 c_main_~y~0) 4294967296)) (< 0 (mod (+ 4294967295 c_main_~z~0) 4294967296)) (= |c_#NULL.base| |c_old(#NULL.base)|) (< 0 (mod (+ 4294967294 c_main_~z~0) 4294967296)) (< 0 (mod (+ 11 c_main_~y~0) 4294967296)) (< 0 (mod c_main_~y~0 4294967296)) (< 0 (mod (+ 4294967294 c_main_~y~0) 4294967296)) (< 0 (mod (+ 3 c_main_~y~0) 4294967296)) (< 0 (mod (+ c_main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ c_main_~y~0 1) 4294967296)) (< 0 (mod (+ 4294967295 c_main_~y~0) 4294967296)) (< 0 (mod (+ 8 c_main_~y~0) 4294967296)) (< 0 (mod c_main_~z~0 4294967296)) (< 0 (mod (+ 6 c_main_~y~0) 4294967296)) (< 0 (mod (+ 5 c_main_~y~0) 4294967296)) (< 0 (mod (+ 4 c_main_~y~0) 4294967296)) (< 0 (mod (+ 9 c_main_~y~0) 4294967296)) (< 0 (mod (+ 10 c_main_~y~0) 4294967296)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< 0 (mod (+ 7 c_main_~y~0) 4294967296))) is different from false [2022-04-27 11:27:25,663 WARN L232 SmtUtils]: Spent 7.99s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:27:46,427 WARN L232 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:28:03,529 WARN L232 SmtUtils]: Spent 9.20s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:28:22,906 WARN L232 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:28:25,440 WARN L833 $PredicateComparison]: unable to prove that (and (< 0 (mod (+ 2 c_main_~y~0) 4294967296)) (< 0 (mod (+ 4294967295 c_main_~z~0) 4294967296)) (= |c_#NULL.base| |c_old(#NULL.base)|) (< 0 (mod (+ 4294967294 c_main_~z~0) 4294967296)) (< 0 (mod c_main_~y~0 4294967296)) (< 0 (mod (+ 4294967294 c_main_~y~0) 4294967296)) (< 0 (mod (+ 3 c_main_~y~0) 4294967296)) (< 0 (mod (+ c_main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ c_main_~y~0 1) 4294967296)) (< 0 (mod (+ 4294967295 c_main_~y~0) 4294967296)) (< 0 (mod (+ 8 c_main_~y~0) 4294967296)) (< 0 (mod c_main_~z~0 4294967296)) (< 0 (mod (+ 6 c_main_~y~0) 4294967296)) (< 0 (mod (+ 5 c_main_~y~0) 4294967296)) (< 0 (mod (+ 4 c_main_~y~0) 4294967296)) (< 0 (mod (+ 9 c_main_~y~0) 4294967296)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< 0 (mod (+ 7 c_main_~y~0) 4294967296))) is different from false [2022-04-27 11:28:50,050 WARN L232 SmtUtils]: Spent 7.37s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:28:58,745 WARN L232 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)