/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/mono-crafted_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:19:27,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:19:27,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:19:27,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:19:27,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:19:27,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:19:27,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:19:27,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:19:27,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:19:27,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:19:27,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:19:27,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:19:27,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:19:27,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:19:27,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:19:27,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:19:27,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:19:27,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:19:27,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:19:27,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:19:27,467 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:19:27,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:19:27,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:19:27,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:19:27,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:19:27,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:19:27,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:19:27,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:19:27,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:19:27,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:19:27,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:19:27,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:19:27,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:19:27,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:19:27,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:19:27,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:19:27,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:19:27,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:19:27,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:19:27,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:19:27,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:19:27,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:19:27,482 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:19:27,503 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:19:27,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:19:27,504 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:19:27,504 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:19:27,504 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:19:27,504 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:19:27,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:19:27,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:19:27,505 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:19:27,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:19:27,506 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:19:27,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:19:27,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:19:27,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:19:27,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:19:27,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:19:27,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:19:27,507 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:19:27,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:19:27,507 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:19:27,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:19:27,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:19:27,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:19:27,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:19:27,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:19:27,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:19:27,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:19:27,508 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:19:27,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:19:27,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:19:27,508 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:19:27,508 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:19:27,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:19:27,508 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:19:27,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:19:27,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:19:27,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:19:27,670 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:19:27,670 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:19:27,671 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-04-27 11:19:27,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc97e83a/9fd7a0c827b54a5a8cfa0ab6c7f7709f/FLAGbcabb3180 [2022-04-27 11:19:28,054 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:19:28,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-04-27 11:19:28,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc97e83a/9fd7a0c827b54a5a8cfa0ab6c7f7709f/FLAGbcabb3180 [2022-04-27 11:19:28,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc97e83a/9fd7a0c827b54a5a8cfa0ab6c7f7709f [2022-04-27 11:19:28,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:19:28,498 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:19:28,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:19:28,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:19:28,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:19:28,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:19:28" (1/1) ... [2022-04-27 11:19:28,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40add879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:19:28, skipping insertion in model container [2022-04-27 11:19:28,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:19:28" (1/1) ... [2022-04-27 11:19:28,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:19:28,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:19:28,643 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/mono-crafted_11.c[319,332] [2022-04-27 11:19:28,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:19:28,655 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:19:28,662 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/mono-crafted_11.c[319,332] [2022-04-27 11:19:28,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:19:28,675 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:19:28,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:19:28 WrapperNode [2022-04-27 11:19:28,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:19:28,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:19:28,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:19:28,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:19:28,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:19:28" (1/1) ... [2022-04-27 11:19:28,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:19:28" (1/1) ... [2022-04-27 11:19:28,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:19:28" (1/1) ... [2022-04-27 11:19:28,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:19:28" (1/1) ... [2022-04-27 11:19:28,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:19:28" (1/1) ... [2022-04-27 11:19:28,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:19:28" (1/1) ... [2022-04-27 11:19:28,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:19:28" (1/1) ... [2022-04-27 11:19:28,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:19:28,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:19:28,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:19:28,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:19:28,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:19:28" (1/1) ... [2022-04-27 11:19:28,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:19:28,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:28,718 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:19:28,730 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:19:28,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:19:28,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:19:28,757 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:19:28,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:19:28,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:19:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:19:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:19:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:19:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:19:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:19:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:19:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:19:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:19:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:19:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:19:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:19:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:19:28,808 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:19:28,809 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:19:28,892 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:19:28,896 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:19:28,896 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:19:28,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:19:28 BoogieIcfgContainer [2022-04-27 11:19:28,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:19:28,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:19:28,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:19:28,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:19:28,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:19:28" (1/3) ... [2022-04-27 11:19:28,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d54b8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:19:28, skipping insertion in model container [2022-04-27 11:19:28,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:19:28" (2/3) ... [2022-04-27 11:19:28,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d54b8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:19:28, skipping insertion in model container [2022-04-27 11:19:28,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:19:28" (3/3) ... [2022-04-27 11:19:28,931 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2022-04-27 11:19:28,940 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:19:28,940 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:19:28,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:19:28,987 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@2d80b694, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5225b8f [2022-04-27 11:19:28,987 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:19:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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:19:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:19:28,997 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:28,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:28,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:29,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:29,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 1 times [2022-04-27 11:19:29,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:29,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40317141] [2022-04-27 11:19:29,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:29,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:29,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:29,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-27 11:19:29,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:19:29,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-27 11:19:29,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:29,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-27 11:19:29,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:19:29,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-27 11:19:29,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-27 11:19:29,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0; {23#true} is VALID [2022-04-27 11:19:29,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-27 11:19:29,120 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {24#false} is VALID [2022-04-27 11:19:29,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-27 11:19:29,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-27 11:19:29,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 11:19:29,121 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:19:29,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:29,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40317141] [2022-04-27 11:19:29,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40317141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:19:29,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:19:29,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:19:29,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737871138] [2022-04-27 11:19:29,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:19:29,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 11:19:29,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:29,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:19:29,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:29,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:19:29,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:29,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:19:29,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:19:29,180 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:19:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:29,260 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-27 11:19:29,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:19:29,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 11:19:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:19:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 11:19:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:19:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 11:19:29,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-27 11:19:29,332 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:19:29,337 INFO L225 Difference]: With dead ends: 32 [2022-04-27 11:19:29,337 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 11:19:29,339 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:19:29,341 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 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:19:29,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:19:29,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 11:19:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 11:19:29,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:29,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:29,363 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:29,379 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:29,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:29,386 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 11:19:29,386 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 11:19:29,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:29,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:29,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 13 states. [2022-04-27 11:19:29,386 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 13 states. [2022-04-27 11:19:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:29,393 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 11:19:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 11:19:29,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:29,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:29,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:29,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-27 11:19:29,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-27 11:19:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:29,398 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-27 11:19:29,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:19:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 11:19:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:19:29,401 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:29,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:29,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:19:29,405 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:29,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:29,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2022-04-27 11:19:29,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:29,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184332321] [2022-04-27 11:19:29,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:29,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:29,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {118#true} is VALID [2022-04-27 11:19:29,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-27 11:19:29,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #41#return; {118#true} is VALID [2022-04-27 11:19:29,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:29,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {118#true} is VALID [2022-04-27 11:19:29,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-27 11:19:29,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #41#return; {118#true} is VALID [2022-04-27 11:19:29,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret5 := main(); {118#true} is VALID [2022-04-27 11:19:29,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} ~x~0 := 0; {123#(= main_~x~0 0)} is VALID [2022-04-27 11:19:29,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 100000000); {119#false} is VALID [2022-04-27 11:19:29,532 INFO L272 TraceCheckUtils]: 7: Hoare triple {119#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {119#false} is VALID [2022-04-27 11:19:29,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {119#false} ~cond := #in~cond; {119#false} is VALID [2022-04-27 11:19:29,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {119#false} assume 0 == ~cond; {119#false} is VALID [2022-04-27 11:19:29,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-04-27 11:19:29,534 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:19:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:29,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184332321] [2022-04-27 11:19:29,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184332321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:19:29,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:19:29,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:19:29,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899932165] [2022-04-27 11:19:29,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:19:29,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-27 11:19:29,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:29,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:19:29,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:29,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:19:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:29,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:19:29,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:19:29,550 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:19:29,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:29,614 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-27 11:19:29,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:19:29,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-27 11:19:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:19:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 11:19:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:19:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 11:19:29,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-27 11:19:29,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:29,644 INFO L225 Difference]: With dead ends: 22 [2022-04-27 11:19:29,644 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 11:19:29,647 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:19:29,649 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:29,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:19:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 11:19:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 11:19:29,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:29,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:29,655 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:29,655 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:29,656 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 11:19:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 11:19:29,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:29,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:29,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 15 states. [2022-04-27 11:19:29,657 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 15 states. [2022-04-27 11:19:29,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:29,658 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 11:19:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 11:19:29,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:29,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:29,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:29,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 11:19:29,662 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-27 11:19:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:29,663 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 11:19:29,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:19:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 11:19:29,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 11:19:29,664 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:29,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:29,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:19:29,664 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:29,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:29,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1372110560, now seen corresponding path program 1 times [2022-04-27 11:19:29,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:29,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212340970] [2022-04-27 11:19:29,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:29,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:29,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:29,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {215#true} is VALID [2022-04-27 11:19:29,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 11:19:29,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215#true} {215#true} #41#return; {215#true} is VALID [2022-04-27 11:19:29,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:29,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {215#true} is VALID [2022-04-27 11:19:29,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 11:19:29,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #41#return; {215#true} is VALID [2022-04-27 11:19:29,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret5 := main(); {215#true} is VALID [2022-04-27 11:19:29,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#true} ~x~0 := 0; {220#(= main_~x~0 0)} is VALID [2022-04-27 11:19:29,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {220#(= main_~x~0 0)} is VALID [2022-04-27 11:19:29,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {221#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:19:29,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 100000000); {216#false} is VALID [2022-04-27 11:19:29,743 INFO L272 TraceCheckUtils]: 9: Hoare triple {216#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {216#false} is VALID [2022-04-27 11:19:29,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#false} ~cond := #in~cond; {216#false} is VALID [2022-04-27 11:19:29,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} assume 0 == ~cond; {216#false} is VALID [2022-04-27 11:19:29,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-04-27 11:19:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:19:29,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:29,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212340970] [2022-04-27 11:19:29,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212340970] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:29,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909869348] [2022-04-27 11:19:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:29,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:29,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:29,746 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:19:29,761 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:19:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:29,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 11:19:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:29,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:29,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2022-04-27 11:19:29,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {215#true} is VALID [2022-04-27 11:19:29,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 11:19:29,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #41#return; {215#true} is VALID [2022-04-27 11:19:29,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret5 := main(); {215#true} is VALID [2022-04-27 11:19:29,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#true} ~x~0 := 0; {220#(= main_~x~0 0)} is VALID [2022-04-27 11:19:29,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {220#(= main_~x~0 0)} is VALID [2022-04-27 11:19:29,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {247#(= main_~x~0 1)} is VALID [2022-04-27 11:19:29,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 100000000); {216#false} is VALID [2022-04-27 11:19:29,855 INFO L272 TraceCheckUtils]: 9: Hoare triple {216#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {216#false} is VALID [2022-04-27 11:19:29,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#false} ~cond := #in~cond; {216#false} is VALID [2022-04-27 11:19:29,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} assume 0 == ~cond; {216#false} is VALID [2022-04-27 11:19:29,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-04-27 11:19:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:19:29,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:29,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-04-27 11:19:29,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} assume 0 == ~cond; {216#false} is VALID [2022-04-27 11:19:29,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#false} ~cond := #in~cond; {216#false} is VALID [2022-04-27 11:19:29,916 INFO L272 TraceCheckUtils]: 9: Hoare triple {216#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {216#false} is VALID [2022-04-27 11:19:29,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {216#false} is VALID [2022-04-27 11:19:29,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {279#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {275#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-27 11:19:29,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {279#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {279#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} is VALID [2022-04-27 11:19:29,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#true} ~x~0 := 0; {279#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} is VALID [2022-04-27 11:19:29,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret5 := main(); {215#true} is VALID [2022-04-27 11:19:29,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #41#return; {215#true} is VALID [2022-04-27 11:19:29,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 11:19:29,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {215#true} is VALID [2022-04-27 11:19:29,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2022-04-27 11:19:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:19:29,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909869348] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:29,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:29,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 11:19:29,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113225698] [2022-04-27 11:19:29,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:29,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 13 [2022-04-27 11:19:29,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:29,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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:29,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:29,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:19:29,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:29,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:19:29,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:19:29,935 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:30,090 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-27 11:19:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:19:30,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 13 [2022-04-27 11:19:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 11:19:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 11:19:30,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-27 11:19:30,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:30,125 INFO L225 Difference]: With dead ends: 26 [2022-04-27 11:19:30,126 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 11:19:30,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:19:30,126 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:30,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 38 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:19:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 11:19:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-27 11:19:30,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:30,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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:30,130 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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:30,131 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:30,132 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 11:19:30,132 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 11:19:30,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:30,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:30,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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 19 states. [2022-04-27 11:19:30,132 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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 19 states. [2022-04-27 11:19:30,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:30,133 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 11:19:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 11:19:30,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:30,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:30,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:30,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-27 11:19:30,134 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-27 11:19:30,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:30,134 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-27 11:19:30,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 11:19:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:19:30,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:30,135 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:30,155 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:19:30,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:30,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:30,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:30,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1870563496, now seen corresponding path program 1 times [2022-04-27 11:19:30,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:30,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794962754] [2022-04-27 11:19:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:30,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:30,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:30,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {416#true} is VALID [2022-04-27 11:19:30,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {416#true} assume true; {416#true} is VALID [2022-04-27 11:19:30,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {416#true} {416#true} #41#return; {416#true} is VALID [2022-04-27 11:19:30,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} call ULTIMATE.init(); {424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:30,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {416#true} is VALID [2022-04-27 11:19:30,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#true} assume true; {416#true} is VALID [2022-04-27 11:19:30,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {416#true} {416#true} #41#return; {416#true} is VALID [2022-04-27 11:19:30,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {416#true} call #t~ret5 := main(); {416#true} is VALID [2022-04-27 11:19:30,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {416#true} ~x~0 := 0; {421#(= main_~x~0 0)} is VALID [2022-04-27 11:19:30,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {421#(= main_~x~0 0)} is VALID [2022-04-27 11:19:30,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:30,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:30,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {423#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:30,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {423#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:30,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {423#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {417#false} is VALID [2022-04-27 11:19:30,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#false} assume !(~x~0 % 4294967296 < 100000000); {417#false} is VALID [2022-04-27 11:19:30,467 INFO L272 TraceCheckUtils]: 13: Hoare triple {417#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {417#false} is VALID [2022-04-27 11:19:30,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {417#false} ~cond := #in~cond; {417#false} is VALID [2022-04-27 11:19:30,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {417#false} assume 0 == ~cond; {417#false} is VALID [2022-04-27 11:19:30,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {417#false} assume !false; {417#false} is VALID [2022-04-27 11:19:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:19:30,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:30,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794962754] [2022-04-27 11:19:30,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794962754] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:30,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658927950] [2022-04-27 11:19:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:30,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:30,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:30,469 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:19:30,507 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:19:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:30,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:19:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:30,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:30,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} call ULTIMATE.init(); {416#true} is VALID [2022-04-27 11:19:30,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {416#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {416#true} is VALID [2022-04-27 11:19:30,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#true} assume true; {416#true} is VALID [2022-04-27 11:19:30,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {416#true} {416#true} #41#return; {416#true} is VALID [2022-04-27 11:19:30,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {416#true} call #t~ret5 := main(); {416#true} is VALID [2022-04-27 11:19:30,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {416#true} ~x~0 := 0; {421#(= main_~x~0 0)} is VALID [2022-04-27 11:19:30,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {421#(= main_~x~0 0)} is VALID [2022-04-27 11:19:30,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:30,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:30,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {455#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:30,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {455#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {455#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:30,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {455#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {462#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:19:30,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {462#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {462#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:19:30,782 INFO L272 TraceCheckUtils]: 13: Hoare triple {462#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {469#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:19:30,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {473#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:19:30,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {473#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {417#false} is VALID [2022-04-27 11:19:30,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {417#false} assume !false; {417#false} is VALID [2022-04-27 11:19:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:19:30,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:30,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {417#false} assume !false; {417#false} is VALID [2022-04-27 11:19:30,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {473#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {417#false} is VALID [2022-04-27 11:19:30,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {473#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:19:30,901 INFO L272 TraceCheckUtils]: 13: Hoare triple {489#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {469#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:19:30,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {489#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 100000000); {489#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 11:19:30,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {489#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 11:19:30,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {489#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {489#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 11:19:30,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {489#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 11:19:30,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {502#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-27 11:19:30,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {489#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {502#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-27 11:19:30,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 100000000); {489#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 11:19:30,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {416#true} ~x~0 := 0; {489#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 11:19:30,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {416#true} call #t~ret5 := main(); {416#true} is VALID [2022-04-27 11:19:30,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {416#true} {416#true} #41#return; {416#true} is VALID [2022-04-27 11:19:30,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#true} assume true; {416#true} is VALID [2022-04-27 11:19:30,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {416#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {416#true} is VALID [2022-04-27 11:19:30,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} call ULTIMATE.init(); {416#true} is VALID [2022-04-27 11:19:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:19:30,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658927950] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:30,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:30,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-04-27 11:19:30,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722506242] [2022-04-27 11:19:30,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:30,906 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 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:19:30,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:30,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:30,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:30,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 11:19:30,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 11:19:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:19:30,936 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:31,253 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 11:19:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:19:31,253 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 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:19:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-27 11:19:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-27 11:19:31,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 36 transitions. [2022-04-27 11:19:31,288 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:19:31,289 INFO L225 Difference]: With dead ends: 34 [2022-04-27 11:19:31,289 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 11:19:31,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:19:31,293 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:31,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:19:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 11:19:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-27 11:19:31,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:31,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:31,305 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:31,306 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:31,310 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 11:19:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 11:19:31,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:31,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:31,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:19:31,311 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:19:31,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:31,312 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 11:19:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 11:19:31,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:31,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:31,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:31,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-27 11:19:31,315 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-04-27 11:19:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:31,315 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-27 11:19:31,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-27 11:19:31,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:19:31,316 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:31,317 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:31,334 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:19:31,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 11:19:31,533 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:31,533 INFO L85 PathProgramCache]: Analyzing trace with hash -402805515, now seen corresponding path program 2 times [2022-04-27 11:19:31,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:31,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615608400] [2022-04-27 11:19:31,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:31,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:31,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {679#true} is VALID [2022-04-27 11:19:31,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#true} assume true; {679#true} is VALID [2022-04-27 11:19:31,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {679#true} {679#true} #41#return; {679#true} is VALID [2022-04-27 11:19:31,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:31,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {679#true} is VALID [2022-04-27 11:19:31,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2022-04-27 11:19:31,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #41#return; {679#true} is VALID [2022-04-27 11:19:31,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret5 := main(); {679#true} is VALID [2022-04-27 11:19:31,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {679#true} ~x~0 := 0; {684#(= main_~x~0 0)} is VALID [2022-04-27 11:19:31,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {684#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {684#(= main_~x~0 0)} is VALID [2022-04-27 11:19:31,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {684#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:31,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:31,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:31,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:31,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {687#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 11:19:31,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {687#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !!(~x~0 % 4294967296 < 100000000); {687#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 11:19:31,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {687#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {680#false} is VALID [2022-04-27 11:19:31,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#false} assume !(~x~0 % 4294967296 < 100000000); {680#false} is VALID [2022-04-27 11:19:31,684 INFO L272 TraceCheckUtils]: 15: Hoare triple {680#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {680#false} is VALID [2022-04-27 11:19:31,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2022-04-27 11:19:31,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {680#false} assume 0 == ~cond; {680#false} is VALID [2022-04-27 11:19:31,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {680#false} assume !false; {680#false} is VALID [2022-04-27 11:19:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:19:31,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:31,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615608400] [2022-04-27 11:19:31,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615608400] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:31,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853373277] [2022-04-27 11:19:31,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:19:31,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:31,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:31,686 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:19:31,687 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:19:31,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:19:31,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:19:31,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:19:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:31,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:31,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2022-04-27 11:19:31,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {679#true} is VALID [2022-04-27 11:19:31,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2022-04-27 11:19:31,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #41#return; {679#true} is VALID [2022-04-27 11:19:31,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret5 := main(); {679#true} is VALID [2022-04-27 11:19:31,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {679#true} ~x~0 := 0; {684#(= main_~x~0 0)} is VALID [2022-04-27 11:19:31,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {684#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {684#(= main_~x~0 0)} is VALID [2022-04-27 11:19:31,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {684#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:31,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:31,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:31,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:31,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:19:31,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:19:31,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {732#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:19:31,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {732#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 100000000); {680#false} is VALID [2022-04-27 11:19:31,929 INFO L272 TraceCheckUtils]: 15: Hoare triple {680#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {680#false} is VALID [2022-04-27 11:19:31,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2022-04-27 11:19:31,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {680#false} assume 0 == ~cond; {680#false} is VALID [2022-04-27 11:19:31,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {680#false} assume !false; {680#false} is VALID [2022-04-27 11:19:31,930 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:19:31,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:32,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {680#false} assume !false; {680#false} is VALID [2022-04-27 11:19:32,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {680#false} assume 0 == ~cond; {680#false} is VALID [2022-04-27 11:19:32,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2022-04-27 11:19:32,050 INFO L272 TraceCheckUtils]: 15: Hoare triple {680#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {680#false} is VALID [2022-04-27 11:19:32,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {680#false} is VALID [2022-04-27 11:19:32,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {764#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {760#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-27 11:19:32,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {764#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {764#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-27 11:19:32,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {771#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {764#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-27 11:19:32,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {771#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {771#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-27 11:19:32,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {778#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {771#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-27 11:19:32,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {778#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {778#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-27 11:19:32,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {785#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {778#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-27 11:19:32,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {785#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {785#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-27 11:19:32,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {679#true} ~x~0 := 0; {785#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-27 11:19:32,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret5 := main(); {679#true} is VALID [2022-04-27 11:19:32,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #41#return; {679#true} is VALID [2022-04-27 11:19:32,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2022-04-27 11:19:32,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {679#true} is VALID [2022-04-27 11:19:32,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2022-04-27 11:19:32,056 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:19:32,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853373277] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:32,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:32,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-04-27 11:19:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024082453] [2022-04-27 11:19:32,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:32,058 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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 19 [2022-04-27 11:19:32,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:32,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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:32,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:32,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:19:32,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:32,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:19:32,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:19:32,081 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:32,525 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-27 11:19:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:19:32,525 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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 19 [2022-04-27 11:19:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-27 11:19:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-27 11:19:32,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-27 11:19:32,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:32,572 INFO L225 Difference]: With dead ends: 43 [2022-04-27 11:19:32,572 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 11:19:32,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2022-04-27 11:19:32,573 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:32,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 38 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:19:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 11:19:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-04-27 11:19:32,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:32,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:32,588 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:32,588 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:32,589 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-27 11:19:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-27 11:19:32,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:32,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:32,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:19:32,590 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:19:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:32,591 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-27 11:19:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-27 11:19:32,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:32,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:32,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:32,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-27 11:19:32,592 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2022-04-27 11:19:32,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:32,592 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-27 11:19:32,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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:32,592 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-27 11:19:32,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:19:32,593 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:32,593 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:32,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 11:19:32,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:32,803 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:32,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1358454501, now seen corresponding path program 3 times [2022-04-27 11:19:32,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:32,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912265818] [2022-04-27 11:19:32,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:32,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:32,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:32,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {1009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {998#true} is VALID [2022-04-27 11:19:32,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {998#true} assume true; {998#true} is VALID [2022-04-27 11:19:32,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {998#true} {998#true} #41#return; {998#true} is VALID [2022-04-27 11:19:32,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {998#true} call ULTIMATE.init(); {1009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:32,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {1009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {998#true} is VALID [2022-04-27 11:19:32,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {998#true} assume true; {998#true} is VALID [2022-04-27 11:19:32,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {998#true} {998#true} #41#return; {998#true} is VALID [2022-04-27 11:19:32,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {998#true} call #t~ret5 := main(); {998#true} is VALID [2022-04-27 11:19:32,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {998#true} ~x~0 := 0; {1003#(= main_~x~0 0)} is VALID [2022-04-27 11:19:32,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {1003#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1003#(= main_~x~0 0)} is VALID [2022-04-27 11:19:32,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {1003#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1004#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:32,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {1004#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1004#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:32,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {1004#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:32,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {1005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:32,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {1005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1006#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:19:32,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {1006#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1006#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:19:32,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {1006#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:19:32,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {1007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:19:32,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {1007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1008#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-27 11:19:32,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {1008#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1008#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-27 11:19:32,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {1008#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {999#false} is VALID [2022-04-27 11:19:32,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#false} assume !!(~x~0 % 4294967296 < 100000000); {999#false} is VALID [2022-04-27 11:19:32,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {999#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {999#false} is VALID [2022-04-27 11:19:32,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {999#false} assume !!(~x~0 % 4294967296 < 100000000); {999#false} is VALID [2022-04-27 11:19:32,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {999#false} is VALID [2022-04-27 11:19:32,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {999#false} assume !(~x~0 % 4294967296 < 100000000); {999#false} is VALID [2022-04-27 11:19:32,918 INFO L272 TraceCheckUtils]: 23: Hoare triple {999#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {999#false} is VALID [2022-04-27 11:19:32,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#false} ~cond := #in~cond; {999#false} is VALID [2022-04-27 11:19:32,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {999#false} assume 0 == ~cond; {999#false} is VALID [2022-04-27 11:19:32,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {999#false} assume !false; {999#false} is VALID [2022-04-27 11:19:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:19:32,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:32,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912265818] [2022-04-27 11:19:32,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912265818] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:32,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804558561] [2022-04-27 11:19:32,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:19:32,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:32,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:32,940 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:19:32,941 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:19:33,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-04-27 11:19:33,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:19:33,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:19:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:33,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:33,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {998#true} call ULTIMATE.init(); {998#true} is VALID [2022-04-27 11:19:33,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {998#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {998#true} is VALID [2022-04-27 11:19:33,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {998#true} assume true; {998#true} is VALID [2022-04-27 11:19:33,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {998#true} {998#true} #41#return; {998#true} is VALID [2022-04-27 11:19:33,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {998#true} call #t~ret5 := main(); {998#true} is VALID [2022-04-27 11:19:33,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {998#true} ~x~0 := 0; {998#true} is VALID [2022-04-27 11:19:33,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {998#true} assume !!(~x~0 % 4294967296 < 100000000); {998#true} is VALID [2022-04-27 11:19:33,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {998#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {998#true} is VALID [2022-04-27 11:19:33,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {998#true} assume !!(~x~0 % 4294967296 < 100000000); {998#true} is VALID [2022-04-27 11:19:33,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {998#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {998#true} is VALID [2022-04-27 11:19:33,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {998#true} assume !!(~x~0 % 4294967296 < 100000000); {998#true} is VALID [2022-04-27 11:19:33,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {998#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {998#true} is VALID [2022-04-27 11:19:33,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {998#true} assume !!(~x~0 % 4294967296 < 100000000); {998#true} is VALID [2022-04-27 11:19:33,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {998#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {998#true} is VALID [2022-04-27 11:19:33,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {998#true} assume !!(~x~0 % 4294967296 < 100000000); {998#true} is VALID [2022-04-27 11:19:33,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {998#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1058#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-27 11:19:33,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {1058#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {1058#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-27 11:19:33,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {1058#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1065#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-27 11:19:33,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {1065#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {1065#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-27 11:19:33,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {1065#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1072#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 11:19:33,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {1072#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 11:19:33,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {1072#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1079#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (<= 10000000 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:19:33,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {1079#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (<= 10000000 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {999#false} is VALID [2022-04-27 11:19:33,445 INFO L272 TraceCheckUtils]: 23: Hoare triple {999#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {999#false} is VALID [2022-04-27 11:19:33,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#false} ~cond := #in~cond; {999#false} is VALID [2022-04-27 11:19:33,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {999#false} assume 0 == ~cond; {999#false} is VALID [2022-04-27 11:19:33,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {999#false} assume !false; {999#false} is VALID [2022-04-27 11:19:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-27 11:19:33,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:34,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {999#false} assume !false; {999#false} is VALID [2022-04-27 11:19:34,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {999#false} assume 0 == ~cond; {999#false} is VALID [2022-04-27 11:19:34,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#false} ~cond := #in~cond; {999#false} is VALID [2022-04-27 11:19:34,109 INFO L272 TraceCheckUtils]: 23: Hoare triple {999#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {999#false} is VALID [2022-04-27 11:19:34,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {1107#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {999#false} is VALID [2022-04-27 11:19:34,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {1111#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1107#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-27 11:19:34,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {1115#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1111#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-27 11:19:34,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {1119#(or (<= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1115#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-27 11:19:34,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {1119#(or (<= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {1119#(or (<= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-27 11:19:34,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {1126#(or (<= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1119#(or (<= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-27 11:19:34,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {1126#(or (<= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {1126#(or (<= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-27 11:19:34,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {998#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1126#(or (<= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-27 11:19:34,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {998#true} assume !!(~x~0 % 4294967296 < 100000000); {998#true} is VALID [2022-04-27 11:19:34,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {998#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {998#true} is VALID [2022-04-27 11:19:34,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {998#true} assume !!(~x~0 % 4294967296 < 100000000); {998#true} is VALID [2022-04-27 11:19:34,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {998#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {998#true} is VALID [2022-04-27 11:19:34,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {998#true} assume !!(~x~0 % 4294967296 < 100000000); {998#true} is VALID [2022-04-27 11:19:34,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {998#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {998#true} is VALID [2022-04-27 11:19:34,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {998#true} assume !!(~x~0 % 4294967296 < 100000000); {998#true} is VALID [2022-04-27 11:19:34,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {998#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {998#true} is VALID [2022-04-27 11:19:34,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {998#true} assume !!(~x~0 % 4294967296 < 100000000); {998#true} is VALID [2022-04-27 11:19:34,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {998#true} ~x~0 := 0; {998#true} is VALID [2022-04-27 11:19:34,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {998#true} call #t~ret5 := main(); {998#true} is VALID [2022-04-27 11:19:34,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {998#true} {998#true} #41#return; {998#true} is VALID [2022-04-27 11:19:34,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {998#true} assume true; {998#true} is VALID [2022-04-27 11:19:34,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {998#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {998#true} is VALID [2022-04-27 11:19:34,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {998#true} call ULTIMATE.init(); {998#true} is VALID [2022-04-27 11:19:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-27 11:19:34,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804558561] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:34,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:34,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 18 [2022-04-27 11:19:34,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611330341] [2022-04-27 11:19:34,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:34,118 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 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 27 [2022-04-27 11:19:34,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:34,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 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:19:34,164 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:19:34,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 11:19:34,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:34,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 11:19:34,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:19:34,165 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 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:19:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:35,687 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2022-04-27 11:19:35,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 11:19:35,687 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 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 27 [2022-04-27 11:19:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 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:19:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-27 11:19:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 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:19:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-27 11:19:35,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 66 transitions. [2022-04-27 11:19:36,001 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:19:36,002 INFO L225 Difference]: With dead ends: 75 [2022-04-27 11:19:36,002 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 11:19:36,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 11:19:36,003 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:36,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 43 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:19:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 11:19:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-04-27 11:19:36,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:36,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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:36,073 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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:36,073 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:36,074 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-27 11:19:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-27 11:19:36,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:36,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:36,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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 61 states. [2022-04-27 11:19:36,076 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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 61 states. [2022-04-27 11:19:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:36,078 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-27 11:19:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-27 11:19:36,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:36,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:36,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:36,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-04-27 11:19:36,084 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 27 [2022-04-27 11:19:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:36,085 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-04-27 11:19:36,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 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:19:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-27 11:19:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 11:19:36,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:36,086 INFO L195 NwaCegarLoop]: trace histogram [15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:36,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 11:19:36,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:36,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:36,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1456256282, now seen corresponding path program 4 times [2022-04-27 11:19:36,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:36,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453060276] [2022-04-27 11:19:36,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:36,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:36,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:36,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {1544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1531#true} is VALID [2022-04-27 11:19:36,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#true} assume true; {1531#true} is VALID [2022-04-27 11:19:36,423 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1531#true} {1531#true} #41#return; {1531#true} is VALID [2022-04-27 11:19:36,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} call ULTIMATE.init(); {1544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:36,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {1544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1531#true} is VALID [2022-04-27 11:19:36,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {1531#true} assume true; {1531#true} is VALID [2022-04-27 11:19:36,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1531#true} {1531#true} #41#return; {1531#true} is VALID [2022-04-27 11:19:36,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {1531#true} call #t~ret5 := main(); {1531#true} is VALID [2022-04-27 11:19:36,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {1531#true} ~x~0 := 0; {1536#(= main_~x~0 0)} is VALID [2022-04-27 11:19:36,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {1536#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1536#(= main_~x~0 0)} is VALID [2022-04-27 11:19:36,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {1536#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:36,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:36,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:36,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:36,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:19:36,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:19:36,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:19:36,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:19:36,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:19:36,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:19:36,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:19:36,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:19:36,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1543#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 11:19:36,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {1543#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !!(~x~0 % 4294967296 < 100000000); {1543#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 11:19:36,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {1543#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,432 INFO L272 TraceCheckUtils]: 37: Hoare triple {1532#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1532#false} is VALID [2022-04-27 11:19:36,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {1532#false} ~cond := #in~cond; {1532#false} is VALID [2022-04-27 11:19:36,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {1532#false} assume 0 == ~cond; {1532#false} is VALID [2022-04-27 11:19:36,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {1532#false} assume !false; {1532#false} is VALID [2022-04-27 11:19:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-27 11:19:36,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:36,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453060276] [2022-04-27 11:19:36,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453060276] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:36,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598217648] [2022-04-27 11:19:36,433 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:19:36,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:36,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:36,434 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:19:36,457 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:19:36,478 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:19:36,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:19:36,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 11:19:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:36,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:36,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} call ULTIMATE.init(); {1531#true} is VALID [2022-04-27 11:19:36,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1531#true} is VALID [2022-04-27 11:19:36,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {1531#true} assume true; {1531#true} is VALID [2022-04-27 11:19:36,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1531#true} {1531#true} #41#return; {1531#true} is VALID [2022-04-27 11:19:36,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {1531#true} call #t~ret5 := main(); {1531#true} is VALID [2022-04-27 11:19:36,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {1531#true} ~x~0 := 0; {1536#(= main_~x~0 0)} is VALID [2022-04-27 11:19:36,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {1536#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1536#(= main_~x~0 0)} is VALID [2022-04-27 11:19:36,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {1536#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:36,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:36,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:36,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:36,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:19:36,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:19:36,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:19:36,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:19:36,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:19:36,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:19:36,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:19:36,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:19:36,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1605#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:19:36,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {1605#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1605#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:19:36,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {1605#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:36,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:36,767 INFO L272 TraceCheckUtils]: 37: Hoare triple {1532#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1532#false} is VALID [2022-04-27 11:19:36,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {1532#false} ~cond := #in~cond; {1532#false} is VALID [2022-04-27 11:19:36,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {1532#false} assume 0 == ~cond; {1532#false} is VALID [2022-04-27 11:19:36,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {1532#false} assume !false; {1532#false} is VALID [2022-04-27 11:19:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-27 11:19:36,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:37,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {1532#false} assume !false; {1532#false} is VALID [2022-04-27 11:19:37,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {1532#false} assume 0 == ~cond; {1532#false} is VALID [2022-04-27 11:19:37,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {1532#false} ~cond := #in~cond; {1532#false} is VALID [2022-04-27 11:19:37,128 INFO L272 TraceCheckUtils]: 37: Hoare triple {1532#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1532#false} is VALID [2022-04-27 11:19:37,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {1532#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {1532#false} assume !!(~x~0 % 4294967296 < 100000000); {1532#false} is VALID [2022-04-27 11:19:37,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1532#false} is VALID [2022-04-27 11:19:37,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {1730#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1726#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-27 11:19:37,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {1734#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1730#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-27 11:19:37,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {1734#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1734#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:37,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {1741#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1734#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:37,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {1741#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1741#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:37,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {1748#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1741#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:37,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {1748#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {1748#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-27 11:19:37,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {1755#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1748#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-27 11:19:37,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {1755#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1755#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:37,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {1762#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1755#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:37,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {1762#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {1762#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 11:19:37,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {1769#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1762#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 11:19:37,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {1769#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {1769#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-27 11:19:37,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {1776#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1769#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-27 11:19:37,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {1776#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {1776#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 11:19:37,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {1531#true} ~x~0 := 0; {1776#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 11:19:37,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {1531#true} call #t~ret5 := main(); {1531#true} is VALID [2022-04-27 11:19:37,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1531#true} {1531#true} #41#return; {1531#true} is VALID [2022-04-27 11:19:37,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {1531#true} assume true; {1531#true} is VALID [2022-04-27 11:19:37,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1531#true} is VALID [2022-04-27 11:19:37,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} call ULTIMATE.init(); {1531#true} is VALID [2022-04-27 11:19:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-27 11:19:37,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598217648] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:37,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:37,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 21 [2022-04-27 11:19:37,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400837233] [2022-04-27 11:19:37,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:37,139 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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 41 [2022-04-27 11:19:37,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:37,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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:37,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:37,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 11:19:37,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:37,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 11:19:37,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2022-04-27 11:19:37,175 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:39,666 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-27 11:19:39,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 11:19:39,667 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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 41 [2022-04-27 11:19:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2022-04-27 11:19:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2022-04-27 11:19:39,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 64 transitions. [2022-04-27 11:19:39,736 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:39,737 INFO L225 Difference]: With dead ends: 102 [2022-04-27 11:19:39,737 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 11:19:39,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=421, Invalid=985, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 11:19:39,738 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:39,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 59 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:19:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 11:19:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-27 11:19:39,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:39,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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:39,846 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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:39,846 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:39,847 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-27 11:19:39,847 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-27 11:19:39,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:39,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:39,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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 70 states. [2022-04-27 11:19:39,848 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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 70 states. [2022-04-27 11:19:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:39,849 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-27 11:19:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-27 11:19:39,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:39,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:39,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:39,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2022-04-27 11:19:39,851 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 41 [2022-04-27 11:19:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:39,851 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2022-04-27 11:19:39,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-27 11:19:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 11:19:39,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:39,852 INFO L195 NwaCegarLoop]: trace histogram [25, 17, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:39,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 11:19:40,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:40,067 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:40,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1982129464, now seen corresponding path program 5 times [2022-04-27 11:19:40,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:40,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549075283] [2022-04-27 11:19:40,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:40,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:40,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:40,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {2257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2234#true} is VALID [2022-04-27 11:19:40,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {2234#true} assume true; {2234#true} is VALID [2022-04-27 11:19:40,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2234#true} {2234#true} #41#return; {2234#true} is VALID [2022-04-27 11:19:40,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {2234#true} call ULTIMATE.init(); {2257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:40,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {2257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2234#true} is VALID [2022-04-27 11:19:40,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {2234#true} assume true; {2234#true} is VALID [2022-04-27 11:19:40,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2234#true} {2234#true} #41#return; {2234#true} is VALID [2022-04-27 11:19:40,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {2234#true} call #t~ret5 := main(); {2234#true} is VALID [2022-04-27 11:19:40,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {2234#true} ~x~0 := 0; {2239#(= main_~x~0 0)} is VALID [2022-04-27 11:19:40,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {2239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {2239#(= main_~x~0 0)} is VALID [2022-04-27 11:19:40,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {2239#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:40,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:40,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:40,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:40,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:19:40,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:19:40,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:19:40,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:19:40,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:19:40,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:19:40,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:19:40,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:19:40,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:19:40,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:19:40,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:19:40,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:19:40,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:19:40,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:19:40,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:19:40,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:19:40,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:19:40,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:19:40,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:19:40,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:19:40,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:19:40,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:19:40,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:19:40,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:19:40,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:19:40,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:19:40,455 INFO L290 TraceCheckUtils]: 37: Hoare triple {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:19:40,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:19:40,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2256#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-27 11:19:40,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {2256#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {2256#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {2256#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 43: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 46: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 47: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 48: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 49: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 50: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 51: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 52: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 53: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 54: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 55: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:40,457 INFO L290 TraceCheckUtils]: 56: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:40,458 INFO L272 TraceCheckUtils]: 57: Hoare triple {2235#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2235#false} is VALID [2022-04-27 11:19:40,458 INFO L290 TraceCheckUtils]: 58: Hoare triple {2235#false} ~cond := #in~cond; {2235#false} is VALID [2022-04-27 11:19:40,458 INFO L290 TraceCheckUtils]: 59: Hoare triple {2235#false} assume 0 == ~cond; {2235#false} is VALID [2022-04-27 11:19:40,458 INFO L290 TraceCheckUtils]: 60: Hoare triple {2235#false} assume !false; {2235#false} is VALID [2022-04-27 11:19:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 270 proven. 306 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-27 11:19:40,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:40,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549075283] [2022-04-27 11:19:40,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549075283] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:40,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039321067] [2022-04-27 11:19:40,458 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:19:40,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:40,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:40,459 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:19:40,460 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:19:42,307 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2022-04-27 11:19:42,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:19:42,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-27 11:19:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:42,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:43,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {2234#true} call ULTIMATE.init(); {2234#true} is VALID [2022-04-27 11:19:43,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {2234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2234#true} is VALID [2022-04-27 11:19:43,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {2234#true} assume true; {2234#true} is VALID [2022-04-27 11:19:43,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2234#true} {2234#true} #41#return; {2234#true} is VALID [2022-04-27 11:19:43,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {2234#true} call #t~ret5 := main(); {2234#true} is VALID [2022-04-27 11:19:43,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {2234#true} ~x~0 := 0; {2239#(= main_~x~0 0)} is VALID [2022-04-27 11:19:43,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {2239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {2239#(= main_~x~0 0)} is VALID [2022-04-27 11:19:43,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {2239#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:43,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:19:43,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:43,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:19:43,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:19:43,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:19:43,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:19:43,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:19:43,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:19:43,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:19:43,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:19:43,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:19:43,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:19:43,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:19:43,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:19:43,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:19:43,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:19:43,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:19:43,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:19:43,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:19:43,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:19:43,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:19:43,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:19:43,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:19:43,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:19:43,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:19:43,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:19:43,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:19:43,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:19:43,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:19:43,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:19:43,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:19:43,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2378#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:19:43,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {2378#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {2378#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:19:43,027 INFO L290 TraceCheckUtils]: 41: Hoare triple {2378#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2385#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:19:43,027 INFO L290 TraceCheckUtils]: 42: Hoare triple {2385#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {2385#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:19:43,029 INFO L290 TraceCheckUtils]: 43: Hoare triple {2385#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2392#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 11:19:43,029 INFO L290 TraceCheckUtils]: 44: Hoare triple {2392#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {2392#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 11:19:43,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {2392#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2399#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 11:19:43,030 INFO L290 TraceCheckUtils]: 46: Hoare triple {2399#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {2399#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 11:19:43,031 INFO L290 TraceCheckUtils]: 47: Hoare triple {2399#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:43,031 INFO L290 TraceCheckUtils]: 48: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:43,031 INFO L290 TraceCheckUtils]: 49: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:43,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:43,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:43,031 INFO L290 TraceCheckUtils]: 52: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:43,031 INFO L290 TraceCheckUtils]: 53: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:43,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:43,031 INFO L290 TraceCheckUtils]: 55: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:43,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:43,031 INFO L272 TraceCheckUtils]: 57: Hoare triple {2235#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2235#false} is VALID [2022-04-27 11:19:43,031 INFO L290 TraceCheckUtils]: 58: Hoare triple {2235#false} ~cond := #in~cond; {2235#false} is VALID [2022-04-27 11:19:43,031 INFO L290 TraceCheckUtils]: 59: Hoare triple {2235#false} assume 0 == ~cond; {2235#false} is VALID [2022-04-27 11:19:43,031 INFO L290 TraceCheckUtils]: 60: Hoare triple {2235#false} assume !false; {2235#false} is VALID [2022-04-27 11:19:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 189 proven. 420 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:19:43,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:44,314 INFO L290 TraceCheckUtils]: 60: Hoare triple {2235#false} assume !false; {2235#false} is VALID [2022-04-27 11:19:44,314 INFO L290 TraceCheckUtils]: 59: Hoare triple {2235#false} assume 0 == ~cond; {2235#false} is VALID [2022-04-27 11:19:44,314 INFO L290 TraceCheckUtils]: 58: Hoare triple {2235#false} ~cond := #in~cond; {2235#false} is VALID [2022-04-27 11:19:44,314 INFO L272 TraceCheckUtils]: 57: Hoare triple {2235#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2235#false} is VALID [2022-04-27 11:19:44,314 INFO L290 TraceCheckUtils]: 56: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:44,314 INFO L290 TraceCheckUtils]: 55: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:44,314 INFO L290 TraceCheckUtils]: 54: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:44,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:44,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:44,315 INFO L290 TraceCheckUtils]: 51: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:44,315 INFO L290 TraceCheckUtils]: 50: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:44,315 INFO L290 TraceCheckUtils]: 49: Hoare triple {2235#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:44,315 INFO L290 TraceCheckUtils]: 48: Hoare triple {2235#false} assume !!(~x~0 % 4294967296 < 100000000); {2235#false} is VALID [2022-04-27 11:19:44,315 INFO L290 TraceCheckUtils]: 47: Hoare triple {2484#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2235#false} is VALID [2022-04-27 11:19:44,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {2488#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2484#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-27 11:19:44,317 INFO L290 TraceCheckUtils]: 45: Hoare triple {2492#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2488#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {2492#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2492#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {2499#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2492#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {2499#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2499#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,319 INFO L290 TraceCheckUtils]: 41: Hoare triple {2506#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2499#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {2506#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {2506#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-27 11:19:44,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {2513#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2506#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-27 11:19:44,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {2513#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {2513#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 11:19:44,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {2520#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2513#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 11:19:44,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {2520#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {2520#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-27 11:19:44,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {2527#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2520#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-27 11:19:44,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {2527#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2527#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {2534#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2527#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {2534#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2534#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {2541#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2534#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {2541#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {2541#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-27 11:19:44,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2541#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-27 11:19:44,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {2548#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-27 11:19:44,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {2555#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2548#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-27 11:19:44,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {2555#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2555#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {2562#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2555#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {2562#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2562#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {2569#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2562#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {2569#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2569#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {2576#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2569#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {2576#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2576#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {2583#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2576#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {2583#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2583#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {2590#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2583#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {2590#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2590#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {2597#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2590#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {2597#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2597#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {2604#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2597#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {2604#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2604#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {2611#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2604#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {2611#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2611#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {2618#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2611#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {2618#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2618#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {2625#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2618#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {2625#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {2625#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {2234#true} ~x~0 := 0; {2625#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 11:19:44,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {2234#true} call #t~ret5 := main(); {2234#true} is VALID [2022-04-27 11:19:44,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2234#true} {2234#true} #41#return; {2234#true} is VALID [2022-04-27 11:19:44,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {2234#true} assume true; {2234#true} is VALID [2022-04-27 11:19:44,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {2234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2234#true} is VALID [2022-04-27 11:19:44,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {2234#true} call ULTIMATE.init(); {2234#true} is VALID [2022-04-27 11:19:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 189 proven. 420 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:19:44,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039321067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:44,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:44,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 24] total 47 [2022-04-27 11:19:44,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053489424] [2022-04-27 11:19:44,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:44,354 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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 61 [2022-04-27 11:19:44,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:44,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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:44,461 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:19:44,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-27 11:19:44,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:44,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-27 11:19:44,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=1568, Unknown=0, NotChecked=0, Total=2162 [2022-04-27 11:19:44,462 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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:13,564 WARN L232 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 156 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:21:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:13,727 INFO L93 Difference]: Finished difference Result 148 states and 185 transitions. [2022-04-27 11:21:13,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-27 11:21:13,727 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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 61 [2022-04-27 11:21:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:21:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 123 transitions. [2022-04-27 11:21:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 123 transitions. [2022-04-27 11:21:13,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 123 transitions. [2022-04-27 11:21:13,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:13,995 INFO L225 Difference]: With dead ends: 148 [2022-04-27 11:21:13,996 INFO L226 Difference]: Without dead ends: 116 [2022-04-27 11:21:13,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 88.2s TimeCoverageRelationStatistics Valid=2026, Invalid=5456, Unknown=0, NotChecked=0, Total=7482 [2022-04-27 11:21:13,998 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:21:13,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 134 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 11:21:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-27 11:21:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-27 11:21:14,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:21:14,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 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:14,230 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 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:14,230 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 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:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:14,232 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-04-27 11:21:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-04-27 11:21:14,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:14,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:14,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 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 116 states. [2022-04-27 11:21:14,233 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 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 116 states. [2022-04-27 11:21:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:14,235 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-04-27 11:21:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-04-27 11:21:14,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:14,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:14,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:21:14,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:21:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 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:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2022-04-27 11:21:14,238 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 61 [2022-04-27 11:21:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:21:14,238 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2022-04-27 11:21:14,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-04-27 11:21:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-27 11:21:14,239 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:21:14,239 INFO L195 NwaCegarLoop]: trace histogram [47, 39, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:21:14,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 11:21:14,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:14,444 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:21:14,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:21:14,444 INFO L85 PathProgramCache]: Analyzing trace with hash -966012282, now seen corresponding path program 6 times [2022-04-27 11:21:14,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:21:14,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829561460] [2022-04-27 11:21:14,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:21:14,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:21:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:15,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:21:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:15,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {3404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3359#true} is VALID [2022-04-27 11:21:15,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-04-27 11:21:15,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3359#true} {3359#true} #41#return; {3359#true} is VALID [2022-04-27 11:21:15,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {3359#true} call ULTIMATE.init(); {3404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:21:15,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {3404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3359#true} is VALID [2022-04-27 11:21:15,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-04-27 11:21:15,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3359#true} {3359#true} #41#return; {3359#true} is VALID [2022-04-27 11:21:15,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {3359#true} call #t~ret5 := main(); {3359#true} is VALID [2022-04-27 11:21:15,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {3359#true} ~x~0 := 0; {3364#(= main_~x~0 0)} is VALID [2022-04-27 11:21:15,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {3364#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {3364#(= main_~x~0 0)} is VALID [2022-04-27 11:21:15,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {3364#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3365#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:21:15,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {3365#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {3365#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:21:15,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {3365#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3366#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:21:15,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {3366#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {3366#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:21:15,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {3366#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3367#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:21:15,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {3367#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3367#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:21:15,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {3367#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3368#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:21:15,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {3368#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3368#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:21:15,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {3368#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3369#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:21:15,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {3369#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {3369#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:21:15,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {3369#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3370#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:21:15,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {3370#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {3370#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:21:15,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {3370#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3371#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:21:15,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {3371#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3371#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:21:15,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {3371#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3372#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:21:15,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {3372#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3372#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:21:15,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {3372#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3373#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:21:15,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {3373#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3373#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:21:15,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {3373#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3374#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:21:15,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {3374#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3374#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:21:15,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {3374#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3375#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:21:15,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {3375#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3375#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:21:15,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {3375#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3376#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:21:15,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {3376#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3376#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:21:15,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {3376#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3377#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:21:15,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {3377#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3377#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:21:15,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {3377#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3378#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:21:15,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {3378#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {3378#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:21:15,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {3378#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3379#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:21:15,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {3379#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {3379#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:21:15,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {3379#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3380#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:21:15,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {3380#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3380#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:21:15,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {3380#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3381#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:21:15,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {3381#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {3381#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:21:15,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {3381#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3382#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:21:15,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {3382#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3382#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:21:15,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {3382#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3383#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:21:15,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {3383#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {3383#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:21:15,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {3383#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3384#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 11:21:15,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {3384#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3384#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 11:21:15,340 INFO L290 TraceCheckUtils]: 47: Hoare triple {3384#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3385#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 11:21:15,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {3385#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {3385#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 11:21:15,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {3385#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3386#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 11:21:15,341 INFO L290 TraceCheckUtils]: 50: Hoare triple {3386#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {3386#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 11:21:15,341 INFO L290 TraceCheckUtils]: 51: Hoare triple {3386#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3387#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 11:21:15,342 INFO L290 TraceCheckUtils]: 52: Hoare triple {3387#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {3387#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 11:21:15,342 INFO L290 TraceCheckUtils]: 53: Hoare triple {3387#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3388#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 11:21:15,342 INFO L290 TraceCheckUtils]: 54: Hoare triple {3388#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3388#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 11:21:15,343 INFO L290 TraceCheckUtils]: 55: Hoare triple {3388#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3389#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 11:21:15,343 INFO L290 TraceCheckUtils]: 56: Hoare triple {3389#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3389#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 11:21:15,344 INFO L290 TraceCheckUtils]: 57: Hoare triple {3389#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3390#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 11:21:15,344 INFO L290 TraceCheckUtils]: 58: Hoare triple {3390#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3390#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 11:21:15,344 INFO L290 TraceCheckUtils]: 59: Hoare triple {3390#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3391#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 11:21:15,345 INFO L290 TraceCheckUtils]: 60: Hoare triple {3391#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {3391#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 11:21:15,345 INFO L290 TraceCheckUtils]: 61: Hoare triple {3391#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3392#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 11:21:15,346 INFO L290 TraceCheckUtils]: 62: Hoare triple {3392#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {3392#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 11:21:15,346 INFO L290 TraceCheckUtils]: 63: Hoare triple {3392#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3393#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 11:21:15,346 INFO L290 TraceCheckUtils]: 64: Hoare triple {3393#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3393#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 11:21:15,347 INFO L290 TraceCheckUtils]: 65: Hoare triple {3393#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3394#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 11:21:15,347 INFO L290 TraceCheckUtils]: 66: Hoare triple {3394#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {3394#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 11:21:15,348 INFO L290 TraceCheckUtils]: 67: Hoare triple {3394#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3395#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 11:21:15,348 INFO L290 TraceCheckUtils]: 68: Hoare triple {3395#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {3395#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 11:21:15,349 INFO L290 TraceCheckUtils]: 69: Hoare triple {3395#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3396#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 11:21:15,349 INFO L290 TraceCheckUtils]: 70: Hoare triple {3396#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3396#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 11:21:15,349 INFO L290 TraceCheckUtils]: 71: Hoare triple {3396#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3397#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 11:21:15,350 INFO L290 TraceCheckUtils]: 72: Hoare triple {3397#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3397#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 11:21:15,350 INFO L290 TraceCheckUtils]: 73: Hoare triple {3397#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3398#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 11:21:15,351 INFO L290 TraceCheckUtils]: 74: Hoare triple {3398#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3398#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 11:21:15,351 INFO L290 TraceCheckUtils]: 75: Hoare triple {3398#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3399#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 11:21:15,351 INFO L290 TraceCheckUtils]: 76: Hoare triple {3399#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < 100000000); {3399#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 11:21:15,352 INFO L290 TraceCheckUtils]: 77: Hoare triple {3399#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3400#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 11:21:15,352 INFO L290 TraceCheckUtils]: 78: Hoare triple {3400#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3400#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 11:21:15,353 INFO L290 TraceCheckUtils]: 79: Hoare triple {3400#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3401#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 11:21:15,353 INFO L290 TraceCheckUtils]: 80: Hoare triple {3401#(and (<= main_~x~0 37) (<= 37 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3401#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 11:21:15,353 INFO L290 TraceCheckUtils]: 81: Hoare triple {3401#(and (<= main_~x~0 37) (<= 37 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3402#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 11:21:15,354 INFO L290 TraceCheckUtils]: 82: Hoare triple {3402#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3402#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 11:21:15,354 INFO L290 TraceCheckUtils]: 83: Hoare triple {3402#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3403#(and (<= main_~x~0 39) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:21:15,354 INFO L290 TraceCheckUtils]: 84: Hoare triple {3403#(and (<= main_~x~0 39) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {3403#(and (<= main_~x~0 39) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:21:15,355 INFO L290 TraceCheckUtils]: 85: Hoare triple {3403#(and (<= main_~x~0 39) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3360#false} is VALID [2022-04-27 11:21:15,355 INFO L290 TraceCheckUtils]: 86: Hoare triple {3360#false} assume !!(~x~0 % 4294967296 < 100000000); {3360#false} is VALID [2022-04-27 11:21:15,355 INFO L290 TraceCheckUtils]: 87: Hoare triple {3360#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3360#false} is VALID [2022-04-27 11:21:15,355 INFO L290 TraceCheckUtils]: 88: Hoare triple {3360#false} assume !!(~x~0 % 4294967296 < 100000000); {3360#false} is VALID [2022-04-27 11:21:15,355 INFO L290 TraceCheckUtils]: 89: Hoare triple {3360#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3360#false} is VALID [2022-04-27 11:21:15,355 INFO L290 TraceCheckUtils]: 90: Hoare triple {3360#false} assume !!(~x~0 % 4294967296 < 100000000); {3360#false} is VALID [2022-04-27 11:21:15,355 INFO L290 TraceCheckUtils]: 91: Hoare triple {3360#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3360#false} is VALID [2022-04-27 11:21:15,355 INFO L290 TraceCheckUtils]: 92: Hoare triple {3360#false} assume !!(~x~0 % 4294967296 < 100000000); {3360#false} is VALID [2022-04-27 11:21:15,355 INFO L290 TraceCheckUtils]: 93: Hoare triple {3360#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3360#false} is VALID [2022-04-27 11:21:15,355 INFO L290 TraceCheckUtils]: 94: Hoare triple {3360#false} assume !!(~x~0 % 4294967296 < 100000000); {3360#false} is VALID [2022-04-27 11:21:15,355 INFO L290 TraceCheckUtils]: 95: Hoare triple {3360#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3360#false} is VALID [2022-04-27 11:21:15,355 INFO L290 TraceCheckUtils]: 96: Hoare triple {3360#false} assume !!(~x~0 % 4294967296 < 100000000); {3360#false} is VALID [2022-04-27 11:21:15,356 INFO L290 TraceCheckUtils]: 97: Hoare triple {3360#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3360#false} is VALID [2022-04-27 11:21:15,356 INFO L290 TraceCheckUtils]: 98: Hoare triple {3360#false} assume !!(~x~0 % 4294967296 < 100000000); {3360#false} is VALID [2022-04-27 11:21:15,356 INFO L290 TraceCheckUtils]: 99: Hoare triple {3360#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3360#false} is VALID [2022-04-27 11:21:15,356 INFO L290 TraceCheckUtils]: 100: Hoare triple {3360#false} assume !(~x~0 % 4294967296 < 100000000); {3360#false} is VALID [2022-04-27 11:21:15,356 INFO L272 TraceCheckUtils]: 101: Hoare triple {3360#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3360#false} is VALID [2022-04-27 11:21:15,356 INFO L290 TraceCheckUtils]: 102: Hoare triple {3360#false} ~cond := #in~cond; {3360#false} is VALID [2022-04-27 11:21:15,356 INFO L290 TraceCheckUtils]: 103: Hoare triple {3360#false} assume 0 == ~cond; {3360#false} is VALID [2022-04-27 11:21:15,356 INFO L290 TraceCheckUtils]: 104: Hoare triple {3360#false} assume !false; {3360#false} is VALID [2022-04-27 11:21:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 600 proven. 1560 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-27 11:21:15,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:21:15,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829561460] [2022-04-27 11:21:15,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829561460] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:21:15,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312639247] [2022-04-27 11:21:15,357 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:21:15,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:15,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:21:15,358 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:21:15,359 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:21:17,356 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2022-04-27 11:21:17,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:21:17,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 11:21:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:17,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:21:18,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {3359#true} call ULTIMATE.init(); {3359#true} is VALID [2022-04-27 11:21:18,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {3359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3359#true} is VALID [2022-04-27 11:21:18,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-04-27 11:21:18,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3359#true} {3359#true} #41#return; {3359#true} is VALID [2022-04-27 11:21:18,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {3359#true} call #t~ret5 := main(); {3359#true} is VALID [2022-04-27 11:21:18,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {3359#true} ~x~0 := 0; {3359#true} is VALID [2022-04-27 11:21:18,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 46: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 47: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 58: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 60: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 61: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 66: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 67: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 68: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 69: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 70: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 71: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 72: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 73: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 74: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 75: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 76: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,059 INFO L290 TraceCheckUtils]: 78: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,059 INFO L290 TraceCheckUtils]: 79: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,059 INFO L290 TraceCheckUtils]: 80: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,059 INFO L290 TraceCheckUtils]: 81: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:18,059 INFO L290 TraceCheckUtils]: 82: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:18,065 INFO L290 TraceCheckUtils]: 83: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3657#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,065 INFO L290 TraceCheckUtils]: 84: Hoare triple {3657#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3657#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,066 INFO L290 TraceCheckUtils]: 85: Hoare triple {3657#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3664#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,066 INFO L290 TraceCheckUtils]: 86: Hoare triple {3664#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3664#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,067 INFO L290 TraceCheckUtils]: 87: Hoare triple {3664#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3671#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,067 INFO L290 TraceCheckUtils]: 88: Hoare triple {3671#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3671#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,067 INFO L290 TraceCheckUtils]: 89: Hoare triple {3671#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3678#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,068 INFO L290 TraceCheckUtils]: 90: Hoare triple {3678#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3678#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,068 INFO L290 TraceCheckUtils]: 91: Hoare triple {3678#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3685#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,069 INFO L290 TraceCheckUtils]: 92: Hoare triple {3685#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3685#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,069 INFO L290 TraceCheckUtils]: 93: Hoare triple {3685#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3692#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,070 INFO L290 TraceCheckUtils]: 94: Hoare triple {3692#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3692#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,070 INFO L290 TraceCheckUtils]: 95: Hoare triple {3692#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3699#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,070 INFO L290 TraceCheckUtils]: 96: Hoare triple {3699#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3699#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,071 INFO L290 TraceCheckUtils]: 97: Hoare triple {3699#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3706#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,072 INFO L290 TraceCheckUtils]: 98: Hoare triple {3706#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3706#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} is VALID [2022-04-27 11:21:18,073 INFO L290 TraceCheckUtils]: 99: Hoare triple {3706#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3713#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ main_~x~0 4294967279) 4294967296) 10000000))} is VALID [2022-04-27 11:21:18,077 INFO L290 TraceCheckUtils]: 100: Hoare triple {3713#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ main_~x~0 4294967279) 4294967296) 10000000))} assume !(~x~0 % 4294967296 < 100000000); {3360#false} is VALID [2022-04-27 11:21:18,077 INFO L272 TraceCheckUtils]: 101: Hoare triple {3360#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3360#false} is VALID [2022-04-27 11:21:18,077 INFO L290 TraceCheckUtils]: 102: Hoare triple {3360#false} ~cond := #in~cond; {3360#false} is VALID [2022-04-27 11:21:18,077 INFO L290 TraceCheckUtils]: 103: Hoare triple {3360#false} assume 0 == ~cond; {3360#false} is VALID [2022-04-27 11:21:18,077 INFO L290 TraceCheckUtils]: 104: Hoare triple {3360#false} assume !false; {3360#false} is VALID [2022-04-27 11:21:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 663 proven. 64 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2022-04-27 11:21:18,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:21:20,467 INFO L290 TraceCheckUtils]: 104: Hoare triple {3360#false} assume !false; {3360#false} is VALID [2022-04-27 11:21:20,468 INFO L290 TraceCheckUtils]: 103: Hoare triple {3732#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3360#false} is VALID [2022-04-27 11:21:20,468 INFO L290 TraceCheckUtils]: 102: Hoare triple {3736#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3732#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:21:20,468 INFO L272 TraceCheckUtils]: 101: Hoare triple {3740#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3736#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:21:20,469 INFO L290 TraceCheckUtils]: 100: Hoare triple {3744#(or (< (mod main_~x~0 4294967296) 100000000) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 100000000); {3740#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 11:21:20,469 INFO L290 TraceCheckUtils]: 99: Hoare triple {3748#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3744#(or (< (mod main_~x~0 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,470 INFO L290 TraceCheckUtils]: 98: Hoare triple {3752#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 100000000); {3748#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,478 INFO L290 TraceCheckUtils]: 97: Hoare triple {3756#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3752#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,478 INFO L290 TraceCheckUtils]: 96: Hoare triple {3756#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 100000000); {3756#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,479 INFO L290 TraceCheckUtils]: 95: Hoare triple {3763#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3756#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,480 INFO L290 TraceCheckUtils]: 94: Hoare triple {3763#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {3763#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-27 11:21:20,481 INFO L290 TraceCheckUtils]: 93: Hoare triple {3770#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3763#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-27 11:21:20,481 INFO L290 TraceCheckUtils]: 92: Hoare triple {3770#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 100000000); {3770#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,487 INFO L290 TraceCheckUtils]: 91: Hoare triple {3777#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3770#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,488 INFO L290 TraceCheckUtils]: 90: Hoare triple {3777#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 100000000); {3777#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,489 INFO L290 TraceCheckUtils]: 89: Hoare triple {3784#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3777#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,489 INFO L290 TraceCheckUtils]: 88: Hoare triple {3784#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 100000000); {3784#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,490 INFO L290 TraceCheckUtils]: 87: Hoare triple {3791#(or (< (mod (+ main_~x~0 14) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3784#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,490 INFO L290 TraceCheckUtils]: 86: Hoare triple {3791#(or (< (mod (+ main_~x~0 14) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 100000000); {3791#(or (< (mod (+ main_~x~0 14) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,491 INFO L290 TraceCheckUtils]: 85: Hoare triple {3798#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3791#(or (< (mod (+ main_~x~0 14) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,492 INFO L290 TraceCheckUtils]: 84: Hoare triple {3798#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 100000000); {3798#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,492 INFO L290 TraceCheckUtils]: 83: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3798#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 82: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 81: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 80: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 79: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 78: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 77: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 76: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 75: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 74: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 73: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 72: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 71: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 70: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 69: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 68: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 67: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 66: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 65: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 64: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 63: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 61: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 60: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 59: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 58: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 57: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 56: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 55: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 54: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 53: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 51: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 50: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 47: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 46: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 45: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 44: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 40: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 39: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 34: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 31: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {3359#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {3359#true} assume !!(~x~0 % 4294967296 < 100000000); {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {3359#true} ~x~0 := 0; {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {3359#true} call #t~ret5 := main(); {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3359#true} {3359#true} #41#return; {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {3359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3359#true} is VALID [2022-04-27 11:21:20,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {3359#true} call ULTIMATE.init(); {3359#true} is VALID [2022-04-27 11:21:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 663 proven. 64 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2022-04-27 11:21:20,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312639247] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:21:20,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:21:20,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 11, 15] total 65 [2022-04-27 11:21:20,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790488056] [2022-04-27 11:21:20,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:21:20,500 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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 105 [2022-04-27 11:21:20,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:21:20,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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:21:20,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:20,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-27 11:21:20,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:21:20,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-27 11:21:20,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=935, Invalid=3225, Unknown=0, NotChecked=0, Total=4160 [2022-04-27 11:21:20,645 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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:21:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:33,576 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2022-04-27 11:21:33,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-27 11:21:33,584 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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 105 [2022-04-27 11:21:33,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:21:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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:21:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2022-04-27 11:21:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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:21:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2022-04-27 11:21:33,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 130 transitions. [2022-04-27 11:21:33,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:33,992 INFO L225 Difference]: With dead ends: 165 [2022-04-27 11:21:33,992 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:21:33,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=2162, Invalid=11644, Unknown=0, NotChecked=0, Total=13806 [2022-04-27 11:21:33,996 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 145 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:21:33,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 94 Invalid, 2746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 11:21:33,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:21:33,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:21:33,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:21:33,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:21:33,996 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:21:33,996 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:21:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:33,996 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:21:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:21:33,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:33,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:33,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:21:33,997 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:21:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:33,997 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:21:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:21:33,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:33,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:33,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:21:33,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:21:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:21:33,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:21:33,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2022-04-27 11:21:33,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:21:33,997 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:21:33,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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:21:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:21:33,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:33,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:21:34,007 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:21:34,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:34,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:21:35,958 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 11:21:35,959 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 11:21:35,959 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 11:21:35,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:21:35,959 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:21:35,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:21:35,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:21:35,959 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:21:35,959 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:21:35,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:21:35,959 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 5 18) the Hoare annotation is: true [2022-04-27 11:21:35,959 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 5 18) no Hoare annotation was computed. [2022-04-27 11:21:35,959 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 11:21:35,959 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 5 18) no Hoare annotation was computed. [2022-04-27 11:21:35,959 INFO L899 garLoopResultBuilder]: For program point L9(lines 9 13) no Hoare annotation was computed. [2022-04-27 11:21:35,959 INFO L895 garLoopResultBuilder]: At program point L9-2(lines 8 14) the Hoare annotation is: (or (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000) (= (mod main_~x~0 2) 0)) [2022-04-27 11:21:35,959 INFO L895 garLoopResultBuilder]: At program point L8-2(lines 8 14) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-27 11:21:35,959 INFO L899 garLoopResultBuilder]: For program point L4-3(line 4) no Hoare annotation was computed. [2022-04-27 11:21:35,959 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2022-04-27 11:21:35,959 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 4) no Hoare annotation was computed. [2022-04-27 11:21:35,960 INFO L899 garLoopResultBuilder]: For program point L4(line 4) no Hoare annotation was computed. [2022-04-27 11:21:35,960 INFO L899 garLoopResultBuilder]: For program point L4-1(line 4) no Hoare annotation was computed. [2022-04-27 11:21:35,960 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2022-04-27 11:21:35,962 INFO L356 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-04-27 11:21:35,963 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:21:35,965 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:21:35,965 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:21:35,969 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-04-27 11:21:35,969 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:21:35,969 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:21:35,969 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:21:35,971 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 11:21:35,971 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-04-27 11:21:35,971 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-04-27 11:21:35,971 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:21:35,971 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:21:35,971 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:21:35,972 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 11:21:35,972 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 11:21:35,972 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-04-27 11:21:35,972 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-04-27 11:21:35,972 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2022-04-27 11:21:35,972 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:21:35,972 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:21:35,972 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:21:35,972 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:21:35,972 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:21:35,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:21:35 BoogieIcfgContainer [2022-04-27 11:21:35,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:21:35,982 INFO L158 Benchmark]: Toolchain (without parser) took 127483.79ms. Allocated memory was 187.7MB in the beginning and 276.8MB in the end (delta: 89.1MB). Free memory was 132.3MB in the beginning and 217.2MB in the end (delta: -84.9MB). Peak memory consumption was 139.3MB. Max. memory is 8.0GB. [2022-04-27 11:21:35,982 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:21:35,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.56ms. Allocated memory was 187.7MB in the beginning and 230.7MB in the end (delta: 43.0MB). Free memory was 132.1MB in the beginning and 202.3MB in the end (delta: -70.2MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-04-27 11:21:35,983 INFO L158 Benchmark]: Boogie Preprocessor took 19.00ms. Allocated memory is still 230.7MB. Free memory was 202.3MB in the beginning and 201.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 11:21:35,984 INFO L158 Benchmark]: RCFGBuilder took 213.20ms. Allocated memory is still 230.7MB. Free memory was 200.7MB in the beginning and 190.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 11:21:35,988 INFO L158 Benchmark]: TraceAbstraction took 127070.93ms. Allocated memory was 230.7MB in the beginning and 276.8MB in the end (delta: 46.1MB). Free memory was 189.7MB in the beginning and 217.2MB in the end (delta: -27.5MB). Peak memory consumption was 155.6MB. Max. memory is 8.0GB. [2022-04-27 11:21:35,997 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.56ms. Allocated memory was 187.7MB in the beginning and 230.7MB in the end (delta: 43.0MB). Free memory was 132.1MB in the beginning and 202.3MB in the end (delta: -70.2MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.00ms. Allocated memory is still 230.7MB. Free memory was 202.3MB in the beginning and 201.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 213.20ms. Allocated memory is still 230.7MB. Free memory was 200.7MB in the beginning and 190.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 127070.93ms. Allocated memory was 230.7MB in the beginning and 276.8MB in the end (delta: 46.1MB). Free memory was 189.7MB in the beginning and 217.2MB in the end (delta: -27.5MB). Peak memory consumption was 155.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 127.0s, OverallIterations: 9, TraceHistogramMax: 47, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 108.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 383 mSDsluCounter, 496 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 797 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3831 IncrementalHoareTripleChecker+Invalid, 4628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 797 mSolverCounterUnsat, 107 mSDtfsCounter, 3831 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 846 GetRequests, 515 SyntacticMatches, 12 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2743 ImplicationChecksByTransitivity, 101.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=8, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 81 NumberOfFragments, 29 HoareAnnotationTreeSize, 17 FomulaSimplifications, 6 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12699 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 588 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 848 ConstructedInterpolants, 0 QuantifiedInterpolants, 3842 SizeOfPredicates, 6 NumberOfNonLiveVariables, 713 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 6330/9447 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: (x + 4294967295) % 4294967296 < 10000000 || x % 2 == 0 RESULT: Ultimate proved your program to be correct! [2022-04-27 11:21:36,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...