/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:04:12,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:04:12,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:04:12,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:04:12,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:04:12,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:04:12,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:04:12,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:04:12,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:04:12,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:04:12,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:04:12,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:04:12,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:04:12,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:04:12,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:04:12,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:04:12,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:04:12,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:04:12,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:04:12,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:04:12,587 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:04:12,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:04:12,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:04:12,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:04:12,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:04:12,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:04:12,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:04:12,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:04:12,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:04:12,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:04:12,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:04:12,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:04:12,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:04:12,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:04:12,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:04:12,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:04:12,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:04:12,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:04:12,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:04:12,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:04:12,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:04:12,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:04:12,612 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:04:12,621 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:04:12,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:04:12,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:04:12,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:04:12,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:04:12,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:04:12,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:04:12,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:04:12,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:04:12,624 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:04:12,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:04:12,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:04:12,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:04:12,624 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:04:12,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:04:12,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:04:12,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:04:12,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:04:12,625 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:04:12,625 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:04:12,625 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:04:12,625 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:04:12,625 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:04:12,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:04:12,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:04:12,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:04:12,840 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:04:12,841 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:04:12,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2022-04-15 13:04:12,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5549ef23/ff4786d51be046c2a696e66137b6177a/FLAG05a27db22 [2022-04-15 13:04:13,254 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:04:13,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2022-04-15 13:04:13,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5549ef23/ff4786d51be046c2a696e66137b6177a/FLAG05a27db22 [2022-04-15 13:04:13,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5549ef23/ff4786d51be046c2a696e66137b6177a [2022-04-15 13:04:13,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:04:13,278 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:04:13,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:04:13,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:04:13,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:04:13,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:13" (1/1) ... [2022-04-15 13:04:13,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60c5b744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:13, skipping insertion in model container [2022-04-15 13:04:13,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:13" (1/1) ... [2022-04-15 13:04:13,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:04:13,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:04:13,459 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/nested3-2.c[321,334] [2022-04-15 13:04:13,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:04:13,489 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:04:13,498 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/nested3-2.c[321,334] [2022-04-15 13:04:13,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:04:13,520 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:04:13,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:13 WrapperNode [2022-04-15 13:04:13,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:04:13,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:04:13,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:04:13,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:04:13,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:13" (1/1) ... [2022-04-15 13:04:13,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:13" (1/1) ... [2022-04-15 13:04:13,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:13" (1/1) ... [2022-04-15 13:04:13,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:13" (1/1) ... [2022-04-15 13:04:13,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:13" (1/1) ... [2022-04-15 13:04:13,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:13" (1/1) ... [2022-04-15 13:04:13,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:13" (1/1) ... [2022-04-15 13:04:13,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:04:13,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:04:13,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:04:13,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:04:13,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:13" (1/1) ... [2022-04-15 13:04:13,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:04:13,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:13,585 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-15 13:04:13,614 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-15 13:04:13,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:04:13,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:04:13,626 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:04:13,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:04:13,626 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:04:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:04:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:04:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:04:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:04:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:04:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:04:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:04:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:04:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:04:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:04:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:04:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:04:13,670 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:04:13,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:04:13,849 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:04:13,854 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:04:13,854 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 13:04:13,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:04:13 BoogieIcfgContainer [2022-04-15 13:04:13,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:04:13,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:04:13,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:04:13,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:04:13,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:04:13" (1/3) ... [2022-04-15 13:04:13,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e835766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:04:13, skipping insertion in model container [2022-04-15 13:04:13,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:13" (2/3) ... [2022-04-15 13:04:13,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e835766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:04:13, skipping insertion in model container [2022-04-15 13:04:13,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:04:13" (3/3) ... [2022-04-15 13:04:13,883 INFO L111 eAbstractionObserver]: Analyzing ICFG nested3-2.c [2022-04-15 13:04:13,886 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:04:13,886 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:04:13,935 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:04:13,939 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:04:13,940 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:04:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:04:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:04:13,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:13,964 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:13,965 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:13,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1794590667, now seen corresponding path program 1 times [2022-04-15 13:04:13,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:13,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1735888629] [2022-04-15 13:04:13,989 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:04:13,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1794590667, now seen corresponding path program 2 times [2022-04-15 13:04:13,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:13,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830637903] [2022-04-15 13:04:13,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:14,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:14,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-15 13:04:14,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 13:04:14,150 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-15 13:04:14,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:14,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-15 13:04:14,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 13:04:14,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-15 13:04:14,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret7 := main(); {28#true} is VALID [2022-04-15 13:04:14,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {28#true} is VALID [2022-04-15 13:04:14,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-15 13:04:14,153 INFO L272 TraceCheckUtils]: 7: Hoare triple {29#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)); {29#false} is VALID [2022-04-15 13:04:14,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-15 13:04:14,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-15 13:04:14,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-15 13:04:14,154 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-15 13:04:14,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:14,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830637903] [2022-04-15 13:04:14,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830637903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:14,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:14,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:04:14,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:14,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1735888629] [2022-04-15 13:04:14,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1735888629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:14,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:14,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:04:14,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273491071] [2022-04-15 13:04:14,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:14,162 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-15 13:04:14,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:14,165 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-15 13:04:14,178 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-15 13:04:14,178 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:04:14,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:14,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:04:14,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:04:14,196 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-15 13:04:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:14,312 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-04-15 13:04:14,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:04:14,313 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-15 13:04:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:14,314 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-15 13:04:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-15 13:04:14,323 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-15 13:04:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-15 13:04:14,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-04-15 13:04:14,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:14,419 INFO L225 Difference]: With dead ends: 44 [2022-04-15 13:04:14,419 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 13:04:14,422 INFO L912 BasicCegarLoop]: 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-15 13:04:14,427 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:14,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:04:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 13:04:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 13:04:14,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:14,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:14,464 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:14,465 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:14,469 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 13:04:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 13:04:14,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:14,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:14,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-15 13:04:14,471 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-15 13:04:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:14,475 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-15 13:04:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 13:04:14,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:14,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:14,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:14,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-15 13:04:14,480 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2022-04-15 13:04:14,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:14,480 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-15 13:04:14,481 INFO L479 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-15 13:04:14,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-15 13:04:14,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 13:04:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:04:14,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:14,506 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:14,507 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:04:14,508 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:14,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1824143339, now seen corresponding path program 1 times [2022-04-15 13:04:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:14,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [239206112] [2022-04-15 13:04:14,509 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:04:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1824143339, now seen corresponding path program 2 times [2022-04-15 13:04:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:14,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044854733] [2022-04-15 13:04:14,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:14,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:14,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:14,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {204#true} is VALID [2022-04-15 13:04:14,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-15 13:04:14,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204#true} {204#true} #63#return; {204#true} is VALID [2022-04-15 13:04:14,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:14,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {204#true} is VALID [2022-04-15 13:04:14,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-15 13:04:14,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #63#return; {204#true} is VALID [2022-04-15 13:04:14,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret7 := main(); {204#true} is VALID [2022-04-15 13:04:14,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {209#(= main_~x~0 0)} is VALID [2022-04-15 13:04:14,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {209#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {205#false} is VALID [2022-04-15 13:04:14,613 INFO L272 TraceCheckUtils]: 7: Hoare triple {205#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)); {205#false} is VALID [2022-04-15 13:04:14,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {205#false} ~cond := #in~cond; {205#false} is VALID [2022-04-15 13:04:14,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {205#false} assume 0 == ~cond; {205#false} is VALID [2022-04-15 13:04:14,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {205#false} assume !false; {205#false} is VALID [2022-04-15 13:04:14,613 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-15 13:04:14,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:14,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044854733] [2022-04-15 13:04:14,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044854733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:14,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:14,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:14,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:14,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [239206112] [2022-04-15 13:04:14,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [239206112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:14,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:14,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31747116] [2022-04-15 13:04:14,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:14,615 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-15 13:04:14,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:14,616 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-15 13:04:14,623 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-15 13:04:14,623 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:04:14,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:14,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:04:14,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:04:14,624 INFO L87 Difference]: Start difference. First operand 20 states and 24 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-15 13:04:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:14,743 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 13:04:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:04:14,744 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-15 13:04:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:14,744 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-15 13:04:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-15 13:04:14,749 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-15 13:04:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-15 13:04:14,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-15 13:04:14,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:14,794 INFO L225 Difference]: With dead ends: 34 [2022-04-15 13:04:14,795 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 13:04:14,795 INFO L912 BasicCegarLoop]: 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-15 13:04:14,798 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:14,798 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 27 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:04:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 13:04:14,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-04-15 13:04:14,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:14,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:14,810 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:14,810 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:14,815 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-15 13:04:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 13:04:14,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:14,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:14,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 13:04:14,817 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 13:04:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:14,820 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-15 13:04:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 13:04:14,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:14,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:14,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:14,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-15 13:04:14,825 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2022-04-15 13:04:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:14,825 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-15 13:04:14,826 INFO L479 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-15 13:04:14,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 25 transitions. [2022-04-15 13:04:14,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-15 13:04:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:04:14,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:14,850 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:14,850 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:04:14,850 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:14,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:14,851 INFO L85 PathProgramCache]: Analyzing trace with hash -699512288, now seen corresponding path program 1 times [2022-04-15 13:04:14,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:14,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1919064102] [2022-04-15 13:04:14,854 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:04:14,855 INFO L85 PathProgramCache]: Analyzing trace with hash -699512288, now seen corresponding path program 2 times [2022-04-15 13:04:14,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:14,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505744970] [2022-04-15 13:04:14,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:14,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:14,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:14,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-15 13:04:14,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-15 13:04:14,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {379#true} {379#true} #63#return; {379#true} is VALID [2022-04-15 13:04:14,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:14,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-04-15 13:04:14,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-15 13:04:14,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #63#return; {379#true} is VALID [2022-04-15 13:04:14,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret7 := main(); {379#true} is VALID [2022-04-15 13:04:14,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {379#true} is VALID [2022-04-15 13:04:14,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {384#(= main_~y~0 0)} is VALID [2022-04-15 13:04:14,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#(= main_~y~0 0)} assume !(~y~0 % 4294967296 < 268435455); {380#false} is VALID [2022-04-15 13:04:14,911 INFO L272 TraceCheckUtils]: 8: Hoare triple {380#false} call __VERIFIER_assert((if 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {380#false} is VALID [2022-04-15 13:04:14,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {380#false} ~cond := #in~cond; {380#false} is VALID [2022-04-15 13:04:14,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {380#false} assume 0 == ~cond; {380#false} is VALID [2022-04-15 13:04:14,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-15 13:04:14,912 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-15 13:04:14,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:14,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505744970] [2022-04-15 13:04:14,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505744970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:14,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:14,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:14,912 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:14,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1919064102] [2022-04-15 13:04:14,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1919064102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:14,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:14,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:14,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254166563] [2022-04-15 13:04:14,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:14,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 13:04:14,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:14,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 13:04:14,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:14,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:04:14,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:14,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:04:14,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:04:14,922 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 13:04:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:15,020 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-15 13:04:15,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:04:15,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 13:04:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 13:04:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 13:04:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 13:04:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 13:04:15,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-15 13:04:15,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:15,076 INFO L225 Difference]: With dead ends: 39 [2022-04-15 13:04:15,076 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 13:04:15,077 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-15 13:04:15,079 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:15,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:04:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 13:04:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-15 13:04:15,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:15,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:15,092 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:15,092 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:15,095 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-15 13:04:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 13:04:15,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:15,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:15,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 13:04:15,100 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 13:04:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:15,105 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-15 13:04:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 13:04:15,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:15,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:15,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:15,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-15 13:04:15,109 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2022-04-15 13:04:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:15,109 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-15 13:04:15,109 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 13:04:15,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2022-04-15 13:04:15,132 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-15 13:04:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 13:04:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 13:04:15,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:15,134 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:15,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:04:15,134 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash -185588926, now seen corresponding path program 1 times [2022-04-15 13:04:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:15,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1762332737] [2022-04-15 13:04:15,135 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:04:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash -185588926, now seen corresponding path program 2 times [2022-04-15 13:04:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:15,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632901411] [2022-04-15 13:04:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:15,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:15,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {563#true} is VALID [2022-04-15 13:04:15,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#true} assume true; {563#true} is VALID [2022-04-15 13:04:15,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {563#true} {563#true} #63#return; {563#true} is VALID [2022-04-15 13:04:15,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {563#true} call ULTIMATE.init(); {569#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:15,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {563#true} is VALID [2022-04-15 13:04:15,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {563#true} assume true; {563#true} is VALID [2022-04-15 13:04:15,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {563#true} {563#true} #63#return; {563#true} is VALID [2022-04-15 13:04:15,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {563#true} call #t~ret7 := main(); {563#true} is VALID [2022-04-15 13:04:15,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {563#true} is VALID [2022-04-15 13:04:15,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {563#true} is VALID [2022-04-15 13:04:15,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {568#(= main_~z~0 0)} is VALID [2022-04-15 13:04:15,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {568#(= main_~z~0 0)} assume !(~z~0 % 4294967296 < 268435455); {564#false} is VALID [2022-04-15 13:04:15,195 INFO L272 TraceCheckUtils]: 9: Hoare triple {564#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {564#false} is VALID [2022-04-15 13:04:15,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {564#false} ~cond := #in~cond; {564#false} is VALID [2022-04-15 13:04:15,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#false} assume 0 == ~cond; {564#false} is VALID [2022-04-15 13:04:15,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#false} assume !false; {564#false} is VALID [2022-04-15 13:04:15,196 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-15 13:04:15,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:15,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632901411] [2022-04-15 13:04:15,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632901411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:15,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:15,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:15,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:15,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1762332737] [2022-04-15 13:04:15,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1762332737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:15,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:15,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:04:15,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078935618] [2022-04-15 13:04:15,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:15,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-15 13:04:15,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:15,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-15 13:04:15,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:15,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:04:15,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:15,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:04:15,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:04:15,209 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-15 13:04:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:15,285 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-15 13:04:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:04:15,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-15 13:04:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-15 13:04:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-15 13:04:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-15 13:04:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-15 13:04:15,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-15 13:04:15,341 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-15 13:04:15,342 INFO L225 Difference]: With dead ends: 39 [2022-04-15 13:04:15,342 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 13:04:15,344 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-15 13:04:15,344 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:15,344 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 28 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:04:15,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 13:04:15,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-15 13:04:15,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:15,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:15,348 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:15,348 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:15,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:15,349 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-15 13:04:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 13:04:15,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:15,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:15,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-15 13:04:15,350 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-15 13:04:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:15,351 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-15 13:04:15,351 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 13:04:15,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:15,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:15,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:15,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-15 13:04:15,352 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-04-15 13:04:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:15,352 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-15 13:04:15,353 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-15 13:04:15,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-15 13:04:15,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:15,376 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 13:04:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 13:04:15,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:15,376 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:15,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 13:04:15,376 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:15,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1431986846, now seen corresponding path program 1 times [2022-04-15 13:04:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:15,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [774731475] [2022-04-15 13:04:15,453 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:15,455 INFO L85 PathProgramCache]: Analyzing trace with hash -278509117, now seen corresponding path program 1 times [2022-04-15 13:04:15,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:15,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410974279] [2022-04-15 13:04:15,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:15,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:15,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:15,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:15,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1431986846, now seen corresponding path program 2 times [2022-04-15 13:04:15,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:15,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501469687] [2022-04-15 13:04:15,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:15,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:15,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:15,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {754#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {747#true} is VALID [2022-04-15 13:04:15,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} assume true; {747#true} is VALID [2022-04-15 13:04:15,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {747#true} {747#true} #63#return; {747#true} is VALID [2022-04-15 13:04:15,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {754#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:15,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {754#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {747#true} is VALID [2022-04-15 13:04:15,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume true; {747#true} is VALID [2022-04-15 13:04:15,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {747#true} {747#true} #63#return; {747#true} is VALID [2022-04-15 13:04:15,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {747#true} call #t~ret7 := main(); {747#true} is VALID [2022-04-15 13:04:15,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {747#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {747#true} is VALID [2022-04-15 13:04:15,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {747#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {747#true} is VALID [2022-04-15 13:04:15,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {752#(= main_~z~0 0)} is VALID [2022-04-15 13:04:15,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {752#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {753#(and (<= main_~z~0 1) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:04:15,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {753#(and (<= main_~z~0 1) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {748#false} is VALID [2022-04-15 13:04:15,603 INFO L272 TraceCheckUtils]: 10: Hoare triple {748#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {748#false} is VALID [2022-04-15 13:04:15,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {748#false} ~cond := #in~cond; {748#false} is VALID [2022-04-15 13:04:15,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {748#false} assume 0 == ~cond; {748#false} is VALID [2022-04-15 13:04:15,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-04-15 13:04:15,604 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-15 13:04:15,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:15,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501469687] [2022-04-15 13:04:15,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501469687] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:15,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145769775] [2022-04-15 13:04:15,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:04:15,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:15,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:15,606 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-15 13:04:15,614 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-15 13:04:15,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:04:15,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:15,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:04:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:15,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:15,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {747#true} is VALID [2022-04-15 13:04:15,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {747#true} is VALID [2022-04-15 13:04:15,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume true; {747#true} is VALID [2022-04-15 13:04:15,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {747#true} {747#true} #63#return; {747#true} is VALID [2022-04-15 13:04:15,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {747#true} call #t~ret7 := main(); {747#true} is VALID [2022-04-15 13:04:15,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {747#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {747#true} is VALID [2022-04-15 13:04:15,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {747#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {747#true} is VALID [2022-04-15 13:04:15,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {752#(= main_~z~0 0)} is VALID [2022-04-15 13:04:15,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {752#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {782#(= (+ (- 1) main_~z~0) 0)} is VALID [2022-04-15 13:04:15,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {782#(= (+ (- 1) main_~z~0) 0)} assume !(~z~0 % 4294967296 < 268435455); {748#false} is VALID [2022-04-15 13:04:15,712 INFO L272 TraceCheckUtils]: 10: Hoare triple {748#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {748#false} is VALID [2022-04-15 13:04:15,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {748#false} ~cond := #in~cond; {748#false} is VALID [2022-04-15 13:04:15,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {748#false} assume 0 == ~cond; {748#false} is VALID [2022-04-15 13:04:15,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-04-15 13:04:15,713 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-15 13:04:15,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:15,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-04-15 13:04:15,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {748#false} assume 0 == ~cond; {748#false} is VALID [2022-04-15 13:04:15,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {748#false} ~cond := #in~cond; {748#false} is VALID [2022-04-15 13:04:15,764 INFO L272 TraceCheckUtils]: 10: Hoare triple {748#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {748#false} is VALID [2022-04-15 13:04:15,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {810#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {748#false} is VALID [2022-04-15 13:04:15,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {814#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {810#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:15,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {814#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:15,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {747#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {747#true} is VALID [2022-04-15 13:04:15,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {747#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {747#true} is VALID [2022-04-15 13:04:15,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {747#true} call #t~ret7 := main(); {747#true} is VALID [2022-04-15 13:04:15,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {747#true} {747#true} #63#return; {747#true} is VALID [2022-04-15 13:04:15,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume true; {747#true} is VALID [2022-04-15 13:04:15,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {747#true} is VALID [2022-04-15 13:04:15,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {747#true} is VALID [2022-04-15 13:04:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:15,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145769775] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:15,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:15,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 13:04:15,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:15,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [774731475] [2022-04-15 13:04:15,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [774731475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:15,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:15,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:04:15,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481880814] [2022-04-15 13:04:15,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:15,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-15 13:04:15,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:15,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 13:04:15,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:15,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:04:15,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:15,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:04:15,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:04:15,779 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 13:04:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:15,901 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 13:04:15,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:04:15,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-15 13:04:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 13:04:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 13:04:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 13:04:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 13:04:15,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-15 13:04:15,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:15,936 INFO L225 Difference]: With dead ends: 41 [2022-04-15 13:04:15,936 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 13:04:15,937 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:04:15,937 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:15,937 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 13:04:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-15 13:04:15,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:15,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:15,943 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:15,943 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:15,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:15,944 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 13:04:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 13:04:15,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:15,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:15,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 13:04:15,945 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 13:04:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:15,946 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 13:04:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 13:04:15,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:15,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:15,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:15,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-15 13:04:15,947 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2022-04-15 13:04:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:15,947 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-15 13:04:15,948 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 13:04:15,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2022-04-15 13:04:15,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 13:04:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:04:15,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:15,974 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:15,998 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-15 13:04:16,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-15 13:04:16,191 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1415616702, now seen corresponding path program 3 times [2022-04-15 13:04:16,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:16,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2094718686] [2022-04-15 13:04:16,247 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:16,249 INFO L85 PathProgramCache]: Analyzing trace with hash -219403773, now seen corresponding path program 1 times [2022-04-15 13:04:16,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:16,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167801280] [2022-04-15 13:04:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:16,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:16,264 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:16,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:16,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1415616702, now seen corresponding path program 4 times [2022-04-15 13:04:16,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:16,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052977145] [2022-04-15 13:04:16,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:16,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:16,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:16,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {1034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1026#true} is VALID [2022-04-15 13:04:16,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {1026#true} assume true; {1026#true} is VALID [2022-04-15 13:04:16,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1026#true} {1026#true} #63#return; {1026#true} is VALID [2022-04-15 13:04:16,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:16,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {1034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1026#true} is VALID [2022-04-15 13:04:16,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {1026#true} assume true; {1026#true} is VALID [2022-04-15 13:04:16,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1026#true} {1026#true} #63#return; {1026#true} is VALID [2022-04-15 13:04:16,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {1026#true} call #t~ret7 := main(); {1026#true} is VALID [2022-04-15 13:04:16,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {1026#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1026#true} is VALID [2022-04-15 13:04:16,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {1026#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1026#true} is VALID [2022-04-15 13:04:16,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {1026#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1031#(= main_~z~0 0)} is VALID [2022-04-15 13:04:16,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {1031#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1032#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:16,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1033#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 2))} is VALID [2022-04-15 13:04:16,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {1033#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 2))} assume !(~z~0 % 4294967296 < 268435455); {1027#false} is VALID [2022-04-15 13:04:16,358 INFO L272 TraceCheckUtils]: 11: Hoare triple {1027#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1027#false} is VALID [2022-04-15 13:04:16,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {1027#false} ~cond := #in~cond; {1027#false} is VALID [2022-04-15 13:04:16,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {1027#false} assume 0 == ~cond; {1027#false} is VALID [2022-04-15 13:04:16,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2022-04-15 13:04:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:16,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:16,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052977145] [2022-04-15 13:04:16,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052977145] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:16,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418133471] [2022-04-15 13:04:16,359 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:04:16,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:16,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:16,360 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-15 13:04:16,379 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-15 13:04:16,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:04:16,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:16,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:04:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:16,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:16,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1026#true} is VALID [2022-04-15 13:04:16,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {1026#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1026#true} is VALID [2022-04-15 13:04:16,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {1026#true} assume true; {1026#true} is VALID [2022-04-15 13:04:16,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1026#true} {1026#true} #63#return; {1026#true} is VALID [2022-04-15 13:04:16,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {1026#true} call #t~ret7 := main(); {1026#true} is VALID [2022-04-15 13:04:16,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {1026#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1026#true} is VALID [2022-04-15 13:04:16,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {1026#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1026#true} is VALID [2022-04-15 13:04:16,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {1026#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1031#(= main_~z~0 0)} is VALID [2022-04-15 13:04:16,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {1031#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1032#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:16,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1065#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:16,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {1065#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {1027#false} is VALID [2022-04-15 13:04:16,621 INFO L272 TraceCheckUtils]: 11: Hoare triple {1027#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1027#false} is VALID [2022-04-15 13:04:16,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {1027#false} ~cond := #in~cond; {1027#false} is VALID [2022-04-15 13:04:16,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {1027#false} assume 0 == ~cond; {1027#false} is VALID [2022-04-15 13:04:16,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2022-04-15 13:04:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:16,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:16,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2022-04-15 13:04:16,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {1027#false} assume 0 == ~cond; {1027#false} is VALID [2022-04-15 13:04:16,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {1027#false} ~cond := #in~cond; {1027#false} is VALID [2022-04-15 13:04:16,686 INFO L272 TraceCheckUtils]: 11: Hoare triple {1027#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1027#false} is VALID [2022-04-15 13:04:16,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {1093#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {1027#false} is VALID [2022-04-15 13:04:16,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {1097#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1093#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:16,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {1101#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1097#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:16,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {1026#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1101#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:16,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {1026#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1026#true} is VALID [2022-04-15 13:04:16,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {1026#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1026#true} is VALID [2022-04-15 13:04:16,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {1026#true} call #t~ret7 := main(); {1026#true} is VALID [2022-04-15 13:04:16,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1026#true} {1026#true} #63#return; {1026#true} is VALID [2022-04-15 13:04:16,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {1026#true} assume true; {1026#true} is VALID [2022-04-15 13:04:16,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {1026#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1026#true} is VALID [2022-04-15 13:04:16,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1026#true} is VALID [2022-04-15 13:04:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:16,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418133471] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:16,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:16,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 13:04:16,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:16,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2094718686] [2022-04-15 13:04:16,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2094718686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:16,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:16,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:04:16,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153307405] [2022-04-15 13:04:16,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:16,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-15 13:04:16,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:16,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-15 13:04:16,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:16,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:04:16,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:16,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:04:16,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:04:16,702 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-15 13:04:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:16,814 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-15 13:04:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:04:16,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-15 13:04:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-15 13:04:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-04-15 13:04:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-15 13:04:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-04-15 13:04:16,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2022-04-15 13:04:16,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:16,851 INFO L225 Difference]: With dead ends: 43 [2022-04-15 13:04:16,851 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 13:04:16,852 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:04:16,852 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:16,852 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:04:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 13:04:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 13:04:16,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:16,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:16,860 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:16,860 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:16,861 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 13:04:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 13:04:16,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:16,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:16,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 13:04:16,861 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 13:04:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:16,862 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 13:04:16,862 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 13:04:16,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:16,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:16,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:16,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-15 13:04:16,864 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2022-04-15 13:04:16,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:16,864 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-15 13:04:16,864 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-15 13:04:16,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-15 13:04:16,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 13:04:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 13:04:16,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:16,891 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:16,922 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-15 13:04:17,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6 [2022-04-15 13:04:17,108 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:17,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash -908142238, now seen corresponding path program 5 times [2022-04-15 13:04:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:17,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002919020] [2022-04-15 13:04:17,161 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:17,162 INFO L85 PathProgramCache]: Analyzing trace with hash -160298429, now seen corresponding path program 1 times [2022-04-15 13:04:17,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:17,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892525619] [2022-04-15 13:04:17,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:17,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:17,175 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:17,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash -908142238, now seen corresponding path program 6 times [2022-04-15 13:04:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:17,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444150417] [2022-04-15 13:04:17,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:17,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:17,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {1332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1323#true} is VALID [2022-04-15 13:04:17,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {1323#true} assume true; {1323#true} is VALID [2022-04-15 13:04:17,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1323#true} {1323#true} #63#return; {1323#true} is VALID [2022-04-15 13:04:17,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {1323#true} call ULTIMATE.init(); {1332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:17,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {1332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1323#true} is VALID [2022-04-15 13:04:17,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {1323#true} assume true; {1323#true} is VALID [2022-04-15 13:04:17,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1323#true} {1323#true} #63#return; {1323#true} is VALID [2022-04-15 13:04:17,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {1323#true} call #t~ret7 := main(); {1323#true} is VALID [2022-04-15 13:04:17,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {1323#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1323#true} is VALID [2022-04-15 13:04:17,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {1323#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1323#true} is VALID [2022-04-15 13:04:17,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {1323#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1328#(= main_~z~0 0)} is VALID [2022-04-15 13:04:17,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {1328#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1329#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:17,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {1329#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1330#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:17,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {1330#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1331#(and (<= main_~z~0 3) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:04:17,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {1331#(and (<= main_~z~0 3) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {1324#false} is VALID [2022-04-15 13:04:17,251 INFO L272 TraceCheckUtils]: 12: Hoare triple {1324#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1324#false} is VALID [2022-04-15 13:04:17,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {1324#false} ~cond := #in~cond; {1324#false} is VALID [2022-04-15 13:04:17,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {1324#false} assume 0 == ~cond; {1324#false} is VALID [2022-04-15 13:04:17,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {1324#false} assume !false; {1324#false} is VALID [2022-04-15 13:04:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:17,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:17,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444150417] [2022-04-15 13:04:17,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444150417] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:17,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347774731] [2022-04-15 13:04:17,252 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:04:17,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:17,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:17,253 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-15 13:04:17,254 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-15 13:04:17,283 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 13:04:17,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:17,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 13:04:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:17,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:17,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {1323#true} call ULTIMATE.init(); {1323#true} is VALID [2022-04-15 13:04:17,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1323#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1323#true} is VALID [2022-04-15 13:04:17,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {1323#true} assume true; {1323#true} is VALID [2022-04-15 13:04:17,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1323#true} {1323#true} #63#return; {1323#true} is VALID [2022-04-15 13:04:17,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {1323#true} call #t~ret7 := main(); {1323#true} is VALID [2022-04-15 13:04:17,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {1323#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1323#true} is VALID [2022-04-15 13:04:17,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {1323#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1323#true} is VALID [2022-04-15 13:04:17,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {1323#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1328#(= main_~z~0 0)} is VALID [2022-04-15 13:04:17,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {1328#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1329#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:17,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {1329#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1330#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:17,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {1330#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1366#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:17,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {1366#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {1324#false} is VALID [2022-04-15 13:04:17,473 INFO L272 TraceCheckUtils]: 12: Hoare triple {1324#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1324#false} is VALID [2022-04-15 13:04:17,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {1324#false} ~cond := #in~cond; {1324#false} is VALID [2022-04-15 13:04:17,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {1324#false} assume 0 == ~cond; {1324#false} is VALID [2022-04-15 13:04:17,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {1324#false} assume !false; {1324#false} is VALID [2022-04-15 13:04:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:17,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:17,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {1324#false} assume !false; {1324#false} is VALID [2022-04-15 13:04:17,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {1324#false} assume 0 == ~cond; {1324#false} is VALID [2022-04-15 13:04:17,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {1324#false} ~cond := #in~cond; {1324#false} is VALID [2022-04-15 13:04:17,566 INFO L272 TraceCheckUtils]: 12: Hoare triple {1324#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1324#false} is VALID [2022-04-15 13:04:17,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {1394#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {1324#false} is VALID [2022-04-15 13:04:17,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {1398#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1394#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:17,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1398#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:17,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {1406#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1402#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:17,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {1323#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1406#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:17,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {1323#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1323#true} is VALID [2022-04-15 13:04:17,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {1323#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1323#true} is VALID [2022-04-15 13:04:17,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {1323#true} call #t~ret7 := main(); {1323#true} is VALID [2022-04-15 13:04:17,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1323#true} {1323#true} #63#return; {1323#true} is VALID [2022-04-15 13:04:17,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {1323#true} assume true; {1323#true} is VALID [2022-04-15 13:04:17,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {1323#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1323#true} is VALID [2022-04-15 13:04:17,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {1323#true} call ULTIMATE.init(); {1323#true} is VALID [2022-04-15 13:04:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:17,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347774731] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:17,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:17,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 13:04:17,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:17,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002919020] [2022-04-15 13:04:17,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002919020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:17,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:17,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:04:17,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623794068] [2022-04-15 13:04:17,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:17,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 16 [2022-04-15 13:04:17,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:17,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-15 13:04:17,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:17,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:04:17,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:17,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:04:17,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-15 13:04:17,585 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-15 13:04:17,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:17,759 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-15 13:04:17,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:04:17,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 16 [2022-04-15 13:04:17,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-15 13:04:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 13:04:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-15 13:04:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 13:04:17,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-15 13:04:17,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:17,800 INFO L225 Difference]: With dead ends: 45 [2022-04-15 13:04:17,801 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 13:04:17,801 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2022-04-15 13:04:17,802 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:17,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 38 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 13:04:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 13:04:17,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:17,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:17,812 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:17,812 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:17,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:17,815 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 13:04:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 13:04:17,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:17,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:17,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 13:04:17,816 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 13:04:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:17,817 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 13:04:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 13:04:17,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:17,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:17,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:17,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-15 13:04:17,818 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2022-04-15 13:04:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:17,818 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-15 13:04:17,818 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-15 13:04:17,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-15 13:04:17,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 13:04:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:04:17,843 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:17,843 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:17,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:18,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:18,061 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:18,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:18,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1938664258, now seen corresponding path program 7 times [2022-04-15 13:04:18,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:18,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1798500183] [2022-04-15 13:04:18,102 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash -101193085, now seen corresponding path program 1 times [2022-04-15 13:04:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:18,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602077484] [2022-04-15 13:04:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:18,114 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:18,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:18,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1938664258, now seen corresponding path program 8 times [2022-04-15 13:04:18,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:18,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331868567] [2022-04-15 13:04:18,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:18,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:18,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:18,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {1648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1638#true} is VALID [2022-04-15 13:04:18,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {1638#true} assume true; {1638#true} is VALID [2022-04-15 13:04:18,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1638#true} {1638#true} #63#return; {1638#true} is VALID [2022-04-15 13:04:18,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {1638#true} call ULTIMATE.init(); {1648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:18,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {1648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1638#true} is VALID [2022-04-15 13:04:18,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {1638#true} assume true; {1638#true} is VALID [2022-04-15 13:04:18,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1638#true} {1638#true} #63#return; {1638#true} is VALID [2022-04-15 13:04:18,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {1638#true} call #t~ret7 := main(); {1638#true} is VALID [2022-04-15 13:04:18,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {1638#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1638#true} is VALID [2022-04-15 13:04:18,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {1638#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1638#true} is VALID [2022-04-15 13:04:18,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {1638#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1643#(= main_~z~0 0)} is VALID [2022-04-15 13:04:18,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {1643#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1644#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:18,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {1644#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1645#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:18,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {1645#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1646#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:18,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {1646#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1647#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:18,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {1647#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 < 268435455); {1639#false} is VALID [2022-04-15 13:04:18,216 INFO L272 TraceCheckUtils]: 13: Hoare triple {1639#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1639#false} is VALID [2022-04-15 13:04:18,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {1639#false} ~cond := #in~cond; {1639#false} is VALID [2022-04-15 13:04:18,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {1639#false} assume 0 == ~cond; {1639#false} is VALID [2022-04-15 13:04:18,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {1639#false} assume !false; {1639#false} is VALID [2022-04-15 13:04:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:18,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:18,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331868567] [2022-04-15 13:04:18,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331868567] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:18,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645735325] [2022-04-15 13:04:18,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:04:18,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:18,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:18,219 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-15 13:04:18,220 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-15 13:04:18,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:04:18,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:18,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 13:04:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:18,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:18,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {1638#true} call ULTIMATE.init(); {1638#true} is VALID [2022-04-15 13:04:18,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {1638#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1638#true} is VALID [2022-04-15 13:04:18,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {1638#true} assume true; {1638#true} is VALID [2022-04-15 13:04:18,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1638#true} {1638#true} #63#return; {1638#true} is VALID [2022-04-15 13:04:18,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {1638#true} call #t~ret7 := main(); {1638#true} is VALID [2022-04-15 13:04:18,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {1638#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1638#true} is VALID [2022-04-15 13:04:18,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {1638#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1638#true} is VALID [2022-04-15 13:04:18,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {1638#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1643#(= main_~z~0 0)} is VALID [2022-04-15 13:04:18,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {1643#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1644#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:18,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {1644#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1645#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:18,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {1645#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1646#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:18,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {1646#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1685#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:18,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {1685#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 < 268435455); {1639#false} is VALID [2022-04-15 13:04:18,426 INFO L272 TraceCheckUtils]: 13: Hoare triple {1639#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1639#false} is VALID [2022-04-15 13:04:18,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {1639#false} ~cond := #in~cond; {1639#false} is VALID [2022-04-15 13:04:18,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {1639#false} assume 0 == ~cond; {1639#false} is VALID [2022-04-15 13:04:18,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {1639#false} assume !false; {1639#false} is VALID [2022-04-15 13:04:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:18,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:18,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {1639#false} assume !false; {1639#false} is VALID [2022-04-15 13:04:18,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {1639#false} assume 0 == ~cond; {1639#false} is VALID [2022-04-15 13:04:18,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {1639#false} ~cond := #in~cond; {1639#false} is VALID [2022-04-15 13:04:18,529 INFO L272 TraceCheckUtils]: 13: Hoare triple {1639#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1639#false} is VALID [2022-04-15 13:04:18,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {1713#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {1639#false} is VALID [2022-04-15 13:04:18,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {1717#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1713#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:18,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {1721#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1717#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:18,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {1725#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1721#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:18,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {1729#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1725#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:18,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {1638#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1729#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:18,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {1638#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1638#true} is VALID [2022-04-15 13:04:18,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {1638#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1638#true} is VALID [2022-04-15 13:04:18,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {1638#true} call #t~ret7 := main(); {1638#true} is VALID [2022-04-15 13:04:18,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1638#true} {1638#true} #63#return; {1638#true} is VALID [2022-04-15 13:04:18,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {1638#true} assume true; {1638#true} is VALID [2022-04-15 13:04:18,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {1638#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1638#true} is VALID [2022-04-15 13:04:18,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {1638#true} call ULTIMATE.init(); {1638#true} is VALID [2022-04-15 13:04:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:18,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645735325] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:18,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:18,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 13:04:18,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:18,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1798500183] [2022-04-15 13:04:18,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1798500183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:18,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:18,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:04:18,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866710269] [2022-04-15 13:04:18,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:18,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:04:18,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:18,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:18,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:18,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:04:18,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:18,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:04:18,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:04:18,552 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:18,751 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-04-15 13:04:18,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:04:18,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:04:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-04-15 13:04:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-04-15 13:04:18,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2022-04-15 13:04:18,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:18,791 INFO L225 Difference]: With dead ends: 47 [2022-04-15 13:04:18,791 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 13:04:18,791 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-04-15 13:04:18,792 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:18,792 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 38 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 13:04:18,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-15 13:04:18,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:18,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:18,801 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:18,801 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:18,802 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 13:04:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-15 13:04:18,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:18,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:18,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-15 13:04:18,802 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-15 13:04:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:18,803 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 13:04:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-15 13:04:18,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:18,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:18,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:18,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:18,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-15 13:04:18,805 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2022-04-15 13:04:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:18,805 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-15 13:04:18,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:18,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-15 13:04:18,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 13:04:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 13:04:18,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:18,870 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:18,887 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-15 13:04:19,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:19,083 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:19,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash -4647582, now seen corresponding path program 9 times [2022-04-15 13:04:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:19,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1223692989] [2022-04-15 13:04:19,122 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash -42087741, now seen corresponding path program 1 times [2022-04-15 13:04:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:19,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643641352] [2022-04-15 13:04:19,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:19,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:19,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:19,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:19,143 INFO L85 PathProgramCache]: Analyzing trace with hash -4647582, now seen corresponding path program 10 times [2022-04-15 13:04:19,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:19,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129201692] [2022-04-15 13:04:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:19,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:19,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {1982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1971#true} is VALID [2022-04-15 13:04:19,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-15 13:04:19,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1971#true} {1971#true} #63#return; {1971#true} is VALID [2022-04-15 13:04:19,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {1971#true} call ULTIMATE.init(); {1982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:19,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {1982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1971#true} is VALID [2022-04-15 13:04:19,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-15 13:04:19,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} #63#return; {1971#true} is VALID [2022-04-15 13:04:19,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {1971#true} call #t~ret7 := main(); {1971#true} is VALID [2022-04-15 13:04:19,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {1971#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1971#true} is VALID [2022-04-15 13:04:19,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {1971#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1971#true} is VALID [2022-04-15 13:04:19,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {1971#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1976#(= main_~z~0 0)} is VALID [2022-04-15 13:04:19,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {1976#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1977#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:19,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {1977#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1978#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:19,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {1978#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1979#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:19,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {1979#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1980#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:19,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {1980#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1981#(and (<= main_~z~0 5) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:04:19,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {1981#(and (<= main_~z~0 5) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {1972#false} is VALID [2022-04-15 13:04:19,227 INFO L272 TraceCheckUtils]: 14: Hoare triple {1972#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1972#false} is VALID [2022-04-15 13:04:19,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {1972#false} ~cond := #in~cond; {1972#false} is VALID [2022-04-15 13:04:19,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {1972#false} assume 0 == ~cond; {1972#false} is VALID [2022-04-15 13:04:19,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {1972#false} assume !false; {1972#false} is VALID [2022-04-15 13:04:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:19,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:19,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129201692] [2022-04-15 13:04:19,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129201692] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:19,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832008875] [2022-04-15 13:04:19,228 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:04:19,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:19,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:19,229 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-15 13:04:19,230 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-15 13:04:19,261 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:04:19,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:19,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 13:04:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:19,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:19,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {1971#true} call ULTIMATE.init(); {1971#true} is VALID [2022-04-15 13:04:19,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1971#true} is VALID [2022-04-15 13:04:19,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-15 13:04:19,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} #63#return; {1971#true} is VALID [2022-04-15 13:04:19,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {1971#true} call #t~ret7 := main(); {1971#true} is VALID [2022-04-15 13:04:19,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {1971#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1971#true} is VALID [2022-04-15 13:04:19,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {1971#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1971#true} is VALID [2022-04-15 13:04:19,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {1971#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1976#(= main_~z~0 0)} is VALID [2022-04-15 13:04:19,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {1976#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1977#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:19,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {1977#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1978#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:19,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {1978#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1979#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:19,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {1979#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1980#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:19,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {1980#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2022#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:19,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {2022#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {1972#false} is VALID [2022-04-15 13:04:19,447 INFO L272 TraceCheckUtils]: 14: Hoare triple {1972#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1972#false} is VALID [2022-04-15 13:04:19,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {1972#false} ~cond := #in~cond; {1972#false} is VALID [2022-04-15 13:04:19,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {1972#false} assume 0 == ~cond; {1972#false} is VALID [2022-04-15 13:04:19,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {1972#false} assume !false; {1972#false} is VALID [2022-04-15 13:04:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:19,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:19,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {1972#false} assume !false; {1972#false} is VALID [2022-04-15 13:04:19,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {1972#false} assume 0 == ~cond; {1972#false} is VALID [2022-04-15 13:04:19,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {1972#false} ~cond := #in~cond; {1972#false} is VALID [2022-04-15 13:04:19,567 INFO L272 TraceCheckUtils]: 14: Hoare triple {1972#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1972#false} is VALID [2022-04-15 13:04:19,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {2050#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {1972#false} is VALID [2022-04-15 13:04:19,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {2054#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2050#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:19,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {2058#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2054#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:19,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {2062#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2058#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:19,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {2066#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2062#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:19,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2066#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:19,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {1971#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2070#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:19,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {1971#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1971#true} is VALID [2022-04-15 13:04:19,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {1971#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1971#true} is VALID [2022-04-15 13:04:19,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {1971#true} call #t~ret7 := main(); {1971#true} is VALID [2022-04-15 13:04:19,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} #63#return; {1971#true} is VALID [2022-04-15 13:04:19,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-04-15 13:04:19,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1971#true} is VALID [2022-04-15 13:04:19,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {1971#true} call ULTIMATE.init(); {1971#true} is VALID [2022-04-15 13:04:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:19,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832008875] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:19,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:19,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 13:04:19,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:19,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1223692989] [2022-04-15 13:04:19,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1223692989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:19,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:19,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:04:19,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782548530] [2022-04-15 13:04:19,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:19,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 13:04:19,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:19,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:19,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:19,586 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:04:19,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:19,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:04:19,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-04-15 13:04:19,587 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:19,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:19,837 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-15 13:04:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:04:19,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 13:04:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-15 13:04:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-15 13:04:19,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2022-04-15 13:04:19,878 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-15 13:04:19,879 INFO L225 Difference]: With dead ends: 49 [2022-04-15 13:04:19,879 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 13:04:19,879 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2022-04-15 13:04:19,880 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:19,880 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 43 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:19,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 13:04:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-15 13:04:19,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:19,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:19,893 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:19,893 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:19,894 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 13:04:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 13:04:19,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:19,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:19,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-15 13:04:19,895 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-15 13:04:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:19,895 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 13:04:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 13:04:19,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:19,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:19,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:19,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-15 13:04:19,897 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2022-04-15 13:04:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:19,897 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-15 13:04:19,897 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:19,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-15 13:04:19,925 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-15 13:04:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-15 13:04:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 13:04:19,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:19,925 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:19,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:20,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13 [2022-04-15 13:04:20,132 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:20,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash -117772478, now seen corresponding path program 11 times [2022-04-15 13:04:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:20,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1446100752] [2022-04-15 13:04:20,174 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash 17017603, now seen corresponding path program 1 times [2022-04-15 13:04:20,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:20,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302820610] [2022-04-15 13:04:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:20,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:20,188 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:20,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:20,200 INFO L85 PathProgramCache]: Analyzing trace with hash -117772478, now seen corresponding path program 12 times [2022-04-15 13:04:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:20,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443657474] [2022-04-15 13:04:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:20,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:20,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {2334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2322#true} is VALID [2022-04-15 13:04:20,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {2322#true} assume true; {2322#true} is VALID [2022-04-15 13:04:20,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2322#true} {2322#true} #63#return; {2322#true} is VALID [2022-04-15 13:04:20,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {2322#true} call ULTIMATE.init(); {2334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:20,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2322#true} is VALID [2022-04-15 13:04:20,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {2322#true} assume true; {2322#true} is VALID [2022-04-15 13:04:20,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2322#true} {2322#true} #63#return; {2322#true} is VALID [2022-04-15 13:04:20,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {2322#true} call #t~ret7 := main(); {2322#true} is VALID [2022-04-15 13:04:20,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {2322#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2322#true} is VALID [2022-04-15 13:04:20,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {2322#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2322#true} is VALID [2022-04-15 13:04:20,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {2322#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2327#(= main_~z~0 0)} is VALID [2022-04-15 13:04:20,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {2327#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2328#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:20,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {2328#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2329#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:20,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {2329#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2330#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:20,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {2330#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2331#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:20,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {2331#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2332#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:20,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {2332#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2333#(and (<= main_~z~0 6) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:04:20,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {2333#(and (<= main_~z~0 6) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {2323#false} is VALID [2022-04-15 13:04:20,325 INFO L272 TraceCheckUtils]: 15: Hoare triple {2323#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {2323#false} is VALID [2022-04-15 13:04:20,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {2323#false} ~cond := #in~cond; {2323#false} is VALID [2022-04-15 13:04:20,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {2323#false} assume 0 == ~cond; {2323#false} is VALID [2022-04-15 13:04:20,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {2323#false} assume !false; {2323#false} is VALID [2022-04-15 13:04:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:20,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:20,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443657474] [2022-04-15 13:04:20,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443657474] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:20,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623525527] [2022-04-15 13:04:20,326 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:04:20,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:20,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:20,327 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-15 13:04:20,348 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-15 13:04:20,373 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 13:04:20,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:20,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 13:04:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:20,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:20,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {2322#true} call ULTIMATE.init(); {2322#true} is VALID [2022-04-15 13:04:20,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {2322#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2322#true} is VALID [2022-04-15 13:04:20,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {2322#true} assume true; {2322#true} is VALID [2022-04-15 13:04:20,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2322#true} {2322#true} #63#return; {2322#true} is VALID [2022-04-15 13:04:20,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {2322#true} call #t~ret7 := main(); {2322#true} is VALID [2022-04-15 13:04:20,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {2322#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2322#true} is VALID [2022-04-15 13:04:20,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {2322#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2322#true} is VALID [2022-04-15 13:04:20,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {2322#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2327#(= main_~z~0 0)} is VALID [2022-04-15 13:04:20,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {2327#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2328#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:20,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {2328#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2329#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:20,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {2329#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2330#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:20,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {2330#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2331#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:20,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {2331#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2332#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:20,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {2332#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2377#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:20,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {2377#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {2323#false} is VALID [2022-04-15 13:04:20,581 INFO L272 TraceCheckUtils]: 15: Hoare triple {2323#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {2323#false} is VALID [2022-04-15 13:04:20,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {2323#false} ~cond := #in~cond; {2323#false} is VALID [2022-04-15 13:04:20,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {2323#false} assume 0 == ~cond; {2323#false} is VALID [2022-04-15 13:04:20,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {2323#false} assume !false; {2323#false} is VALID [2022-04-15 13:04:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:20,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:20,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {2323#false} assume !false; {2323#false} is VALID [2022-04-15 13:04:20,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {2323#false} assume 0 == ~cond; {2323#false} is VALID [2022-04-15 13:04:20,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {2323#false} ~cond := #in~cond; {2323#false} is VALID [2022-04-15 13:04:20,732 INFO L272 TraceCheckUtils]: 15: Hoare triple {2323#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {2323#false} is VALID [2022-04-15 13:04:20,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {2405#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {2323#false} is VALID [2022-04-15 13:04:20,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {2409#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2405#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:20,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {2413#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2409#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:20,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {2417#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2413#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:20,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {2421#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2417#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:20,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {2425#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2421#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:20,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {2429#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2425#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:20,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {2322#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2429#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:04:20,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {2322#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2322#true} is VALID [2022-04-15 13:04:20,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {2322#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2322#true} is VALID [2022-04-15 13:04:20,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {2322#true} call #t~ret7 := main(); {2322#true} is VALID [2022-04-15 13:04:20,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2322#true} {2322#true} #63#return; {2322#true} is VALID [2022-04-15 13:04:20,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {2322#true} assume true; {2322#true} is VALID [2022-04-15 13:04:20,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {2322#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2322#true} is VALID [2022-04-15 13:04:20,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {2322#true} call ULTIMATE.init(); {2322#true} is VALID [2022-04-15 13:04:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:20,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623525527] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:20,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:20,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-15 13:04:20,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:20,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1446100752] [2022-04-15 13:04:20,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1446100752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:20,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:20,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:04:20,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845394387] [2022-04-15 13:04:20,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:20,739 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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 19 [2022-04-15 13:04:20,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:20,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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-15 13:04:20,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:20,750 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 13:04:20,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:20,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 13:04:20,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-04-15 13:04:20,751 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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-15 13:04:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:21,103 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-15 13:04:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 13:04:21,103 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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 19 [2022-04-15 13:04:21,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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-15 13:04:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-15 13:04:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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-15 13:04:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-15 13:04:21,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2022-04-15 13:04:21,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:21,143 INFO L225 Difference]: With dead ends: 51 [2022-04-15 13:04:21,143 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 13:04:21,143 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2022-04-15 13:04:21,144 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:21,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 58 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 13:04:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-15 13:04:21,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:21,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:21,155 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:21,155 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:21,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:21,156 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 13:04:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 13:04:21,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:21,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:21,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 13:04:21,157 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 13:04:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:21,157 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 13:04:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 13:04:21,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:21,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:21,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:21,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-15 13:04:21,158 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2022-04-15 13:04:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:21,159 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-15 13:04:21,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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-15 13:04:21,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2022-04-15 13:04:21,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:21,189 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 13:04:21,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 13:04:21,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:21,189 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:21,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:21,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15 [2022-04-15 13:04:21,399 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash 670323042, now seen corresponding path program 13 times [2022-04-15 13:04:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:21,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [861014912] [2022-04-15 13:04:21,435 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:21,437 INFO L85 PathProgramCache]: Analyzing trace with hash 76122947, now seen corresponding path program 1 times [2022-04-15 13:04:21,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:21,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271597355] [2022-04-15 13:04:21,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:21,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:21,449 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:21,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash 670323042, now seen corresponding path program 14 times [2022-04-15 13:04:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:21,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757646356] [2022-04-15 13:04:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:21,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:21,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:21,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {2704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2691#true} is VALID [2022-04-15 13:04:21,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {2691#true} assume true; {2691#true} is VALID [2022-04-15 13:04:21,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2691#true} {2691#true} #63#return; {2691#true} is VALID [2022-04-15 13:04:21,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {2691#true} call ULTIMATE.init(); {2704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:21,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {2704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2691#true} is VALID [2022-04-15 13:04:21,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {2691#true} assume true; {2691#true} is VALID [2022-04-15 13:04:21,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2691#true} {2691#true} #63#return; {2691#true} is VALID [2022-04-15 13:04:21,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {2691#true} call #t~ret7 := main(); {2691#true} is VALID [2022-04-15 13:04:21,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {2691#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2691#true} is VALID [2022-04-15 13:04:21,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {2691#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2691#true} is VALID [2022-04-15 13:04:21,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {2691#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2696#(= main_~z~0 0)} is VALID [2022-04-15 13:04:21,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {2696#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2697#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:21,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {2697#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2698#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:21,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {2698#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2699#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:21,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {2699#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2700#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:21,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {2700#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2701#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:21,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {2701#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2702#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:21,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {2702#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2703#(and (<= main_~z~0 7) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:04:21,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {2703#(and (<= main_~z~0 7) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {2692#false} is VALID [2022-04-15 13:04:21,593 INFO L272 TraceCheckUtils]: 16: Hoare triple {2692#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {2692#false} is VALID [2022-04-15 13:04:21,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {2692#false} ~cond := #in~cond; {2692#false} is VALID [2022-04-15 13:04:21,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {2692#false} assume 0 == ~cond; {2692#false} is VALID [2022-04-15 13:04:21,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {2692#false} assume !false; {2692#false} is VALID [2022-04-15 13:04:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:21,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:21,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757646356] [2022-04-15 13:04:21,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757646356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:21,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478923197] [2022-04-15 13:04:21,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:04:21,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:21,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:21,595 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-15 13:04:21,596 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-15 13:04:21,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:04:21,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:21,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 13:04:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:21,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:21,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {2691#true} call ULTIMATE.init(); {2691#true} is VALID [2022-04-15 13:04:21,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {2691#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2691#true} is VALID [2022-04-15 13:04:21,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {2691#true} assume true; {2691#true} is VALID [2022-04-15 13:04:21,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2691#true} {2691#true} #63#return; {2691#true} is VALID [2022-04-15 13:04:21,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {2691#true} call #t~ret7 := main(); {2691#true} is VALID [2022-04-15 13:04:21,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {2691#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2691#true} is VALID [2022-04-15 13:04:21,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {2691#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2691#true} is VALID [2022-04-15 13:04:21,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {2691#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2696#(= main_~z~0 0)} is VALID [2022-04-15 13:04:21,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {2696#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2697#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:21,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {2697#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2698#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:21,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {2698#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2699#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:21,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {2699#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2700#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:21,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {2700#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2701#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:21,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {2701#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2702#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:21,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {2702#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2750#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:21,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {2750#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {2692#false} is VALID [2022-04-15 13:04:21,853 INFO L272 TraceCheckUtils]: 16: Hoare triple {2692#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {2692#false} is VALID [2022-04-15 13:04:21,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {2692#false} ~cond := #in~cond; {2692#false} is VALID [2022-04-15 13:04:21,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {2692#false} assume 0 == ~cond; {2692#false} is VALID [2022-04-15 13:04:21,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {2692#false} assume !false; {2692#false} is VALID [2022-04-15 13:04:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:21,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:22,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {2692#false} assume !false; {2692#false} is VALID [2022-04-15 13:04:22,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {2692#false} assume 0 == ~cond; {2692#false} is VALID [2022-04-15 13:04:22,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {2692#false} ~cond := #in~cond; {2692#false} is VALID [2022-04-15 13:04:22,050 INFO L272 TraceCheckUtils]: 16: Hoare triple {2692#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {2692#false} is VALID [2022-04-15 13:04:22,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {2778#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {2692#false} is VALID [2022-04-15 13:04:22,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {2782#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2778#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:22,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {2786#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2782#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:22,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {2790#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2786#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:22,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {2794#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2790#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:22,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {2798#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2794#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:22,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {2802#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2798#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:22,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {2806#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2802#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:04:22,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {2691#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2806#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:22,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {2691#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2691#true} is VALID [2022-04-15 13:04:22,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {2691#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2691#true} is VALID [2022-04-15 13:04:22,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {2691#true} call #t~ret7 := main(); {2691#true} is VALID [2022-04-15 13:04:22,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2691#true} {2691#true} #63#return; {2691#true} is VALID [2022-04-15 13:04:22,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {2691#true} assume true; {2691#true} is VALID [2022-04-15 13:04:22,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {2691#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2691#true} is VALID [2022-04-15 13:04:22,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {2691#true} call ULTIMATE.init(); {2691#true} is VALID [2022-04-15 13:04:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:22,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478923197] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:22,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:22,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 13:04:22,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:22,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [861014912] [2022-04-15 13:04:22,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [861014912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:22,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:22,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:04:22,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757200626] [2022-04-15 13:04:22,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:22,059 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 13:04:22,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:22,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:22,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:22,073 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 13:04:22,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:22,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 13:04:22,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:04:22,073 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:22,423 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-15 13:04:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 13:04:22,424 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 13:04:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-04-15 13:04:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-04-15 13:04:22,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 53 transitions. [2022-04-15 13:04:22,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:22,463 INFO L225 Difference]: With dead ends: 53 [2022-04-15 13:04:22,463 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 13:04:22,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2022-04-15 13:04:22,464 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:22,464 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:04:22,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 13:04:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-15 13:04:22,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:22,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:22,478 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:22,478 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:22,479 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 13:04:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-04-15 13:04:22,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:22,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:22,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 13:04:22,479 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 13:04:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:22,480 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 13:04:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-04-15 13:04:22,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:22,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:22,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:22,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-15 13:04:22,481 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2022-04-15 13:04:22,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:22,481 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-15 13:04:22,481 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:22,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2022-04-15 13:04:22,518 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-15 13:04:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 13:04:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:04:22,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:22,518 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:22,537 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-15 13:04:22,731 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:22,732 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:22,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:22,732 INFO L85 PathProgramCache]: Analyzing trace with hash -668519614, now seen corresponding path program 15 times [2022-04-15 13:04:22,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:22,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [676830783] [2022-04-15 13:04:22,771 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:22,773 INFO L85 PathProgramCache]: Analyzing trace with hash 135228291, now seen corresponding path program 1 times [2022-04-15 13:04:22,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:22,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387443889] [2022-04-15 13:04:22,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:22,789 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:22,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:22,797 INFO L85 PathProgramCache]: Analyzing trace with hash -668519614, now seen corresponding path program 16 times [2022-04-15 13:04:22,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:22,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620172035] [2022-04-15 13:04:22,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:22,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:22,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:22,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {3092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3078#true} is VALID [2022-04-15 13:04:22,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {3078#true} assume true; {3078#true} is VALID [2022-04-15 13:04:22,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3078#true} {3078#true} #63#return; {3078#true} is VALID [2022-04-15 13:04:22,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {3078#true} call ULTIMATE.init(); {3092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:22,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {3092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3078#true} is VALID [2022-04-15 13:04:22,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {3078#true} assume true; {3078#true} is VALID [2022-04-15 13:04:22,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3078#true} {3078#true} #63#return; {3078#true} is VALID [2022-04-15 13:04:22,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {3078#true} call #t~ret7 := main(); {3078#true} is VALID [2022-04-15 13:04:22,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {3078#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3078#true} is VALID [2022-04-15 13:04:22,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {3078#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3078#true} is VALID [2022-04-15 13:04:22,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {3078#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {3083#(= main_~z~0 0)} is VALID [2022-04-15 13:04:22,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {3083#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3084#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:22,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {3084#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3085#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:22,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {3085#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3086#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:22,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {3086#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3087#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:22,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {3087#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3088#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:22,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {3088#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3089#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:22,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {3089#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3090#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:22,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {3090#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3091#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:22,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {3091#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 < 268435455); {3079#false} is VALID [2022-04-15 13:04:22,932 INFO L272 TraceCheckUtils]: 17: Hoare triple {3079#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {3079#false} is VALID [2022-04-15 13:04:22,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {3079#false} ~cond := #in~cond; {3079#false} is VALID [2022-04-15 13:04:22,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {3079#false} assume 0 == ~cond; {3079#false} is VALID [2022-04-15 13:04:22,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {3079#false} assume !false; {3079#false} is VALID [2022-04-15 13:04:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:22,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:22,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620172035] [2022-04-15 13:04:22,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620172035] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:22,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504498633] [2022-04-15 13:04:22,933 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:04:22,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:22,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:22,934 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:22,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 13:04:22,968 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:04:22,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:22,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 13:04:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:22,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:23,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {3078#true} call ULTIMATE.init(); {3078#true} is VALID [2022-04-15 13:04:23,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {3078#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3078#true} is VALID [2022-04-15 13:04:23,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {3078#true} assume true; {3078#true} is VALID [2022-04-15 13:04:23,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3078#true} {3078#true} #63#return; {3078#true} is VALID [2022-04-15 13:04:23,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {3078#true} call #t~ret7 := main(); {3078#true} is VALID [2022-04-15 13:04:23,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {3078#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3078#true} is VALID [2022-04-15 13:04:23,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {3078#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3078#true} is VALID [2022-04-15 13:04:23,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {3078#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {3083#(= main_~z~0 0)} is VALID [2022-04-15 13:04:23,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {3083#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3084#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:23,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {3084#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3085#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:23,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {3085#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3086#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:23,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {3086#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3087#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:23,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {3087#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3088#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:23,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {3088#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3089#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:23,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {3089#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3090#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:23,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {3090#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3141#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:23,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {3141#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 < 268435455); {3141#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:23,210 INFO L272 TraceCheckUtils]: 17: Hoare triple {3141#(and (<= 8 main_~z~0) (<= main_~z~0 8))} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {3148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:04:23,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {3148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:04:23,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {3152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3079#false} is VALID [2022-04-15 13:04:23,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {3079#false} assume !false; {3079#false} is VALID [2022-04-15 13:04:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:23,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:23,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {3079#false} assume !false; {3079#false} is VALID [2022-04-15 13:04:23,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {3152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3079#false} is VALID [2022-04-15 13:04:23,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {3148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:04:23,343 INFO L272 TraceCheckUtils]: 17: Hoare triple {3168#(= (mod main_~z~0 4) 0)} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {3148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:04:23,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {3168#(= (mod main_~z~0 4) 0)} assume !(~z~0 % 4294967296 < 268435455); {3168#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:04:23,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {3175#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3168#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:04:23,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {3179#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3175#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:04:23,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {3183#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3179#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:04:23,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {3168#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3183#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:04:23,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {3175#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3168#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:04:23,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {3179#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3175#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:04:23,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {3183#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3179#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:04:23,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {3168#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3183#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:04:23,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {3078#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {3168#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:04:23,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {3078#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3078#true} is VALID [2022-04-15 13:04:23,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {3078#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3078#true} is VALID [2022-04-15 13:04:23,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {3078#true} call #t~ret7 := main(); {3078#true} is VALID [2022-04-15 13:04:23,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3078#true} {3078#true} #63#return; {3078#true} is VALID [2022-04-15 13:04:23,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {3078#true} assume true; {3078#true} is VALID [2022-04-15 13:04:23,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {3078#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3078#true} is VALID [2022-04-15 13:04:23,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {3078#true} call ULTIMATE.init(); {3078#true} is VALID [2022-04-15 13:04:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 13:04:23,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504498633] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:23,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:23,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 8] total 19 [2022-04-15 13:04:23,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:23,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [676830783] [2022-04-15 13:04:23,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [676830783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:23,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:23,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:04:23,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851672767] [2022-04-15 13:04:23,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:23,351 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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 21 [2022-04-15 13:04:23,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:23,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-15 13:04:23,363 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-15 13:04:23,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 13:04:23,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:23,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 13:04:23,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-04-15 13:04:23,364 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-15 13:04:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:23,872 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-15 13:04:23,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 13:04:23,872 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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 21 [2022-04-15 13:04:23,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-15 13:04:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2022-04-15 13:04:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-15 13:04:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2022-04-15 13:04:23,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 54 transitions. [2022-04-15 13:04:23,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:23,909 INFO L225 Difference]: With dead ends: 55 [2022-04-15 13:04:23,909 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 13:04:23,910 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2022-04-15 13:04:23,910 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:23,910 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 63 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:04:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 13:04:23,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-15 13:04:23,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:23,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:23,922 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:23,922 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:23,923 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 13:04:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 13:04:23,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:23,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:23,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 13:04:23,923 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 13:04:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:23,924 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 13:04:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 13:04:23,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:23,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:23,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:23,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-04-15 13:04:23,926 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 21 [2022-04-15 13:04:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:23,926 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-04-15 13:04:23,926 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-15 13:04:23,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2022-04-15 13:04:23,961 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-15 13:04:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-04-15 13:04:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 13:04:23,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:23,962 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:23,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:24,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:24,176 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:24,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash 777031010, now seen corresponding path program 17 times [2022-04-15 13:04:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:24,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [83584431] [2022-04-15 13:04:24,209 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:24,210 INFO L85 PathProgramCache]: Analyzing trace with hash 194333635, now seen corresponding path program 1 times [2022-04-15 13:04:24,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:24,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505400302] [2022-04-15 13:04:24,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:24,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:24,221 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:24,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:24,231 INFO L85 PathProgramCache]: Analyzing trace with hash 777031010, now seen corresponding path program 18 times [2022-04-15 13:04:24,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:24,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799919038] [2022-04-15 13:04:24,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:24,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:24,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:24,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {3495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3480#true} is VALID [2022-04-15 13:04:24,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {3480#true} assume true; {3480#true} is VALID [2022-04-15 13:04:24,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3480#true} {3480#true} #63#return; {3480#true} is VALID [2022-04-15 13:04:24,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {3480#true} call ULTIMATE.init(); {3495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:24,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {3495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3480#true} is VALID [2022-04-15 13:04:24,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {3480#true} assume true; {3480#true} is VALID [2022-04-15 13:04:24,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3480#true} {3480#true} #63#return; {3480#true} is VALID [2022-04-15 13:04:24,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {3480#true} call #t~ret7 := main(); {3480#true} is VALID [2022-04-15 13:04:24,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {3480#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3480#true} is VALID [2022-04-15 13:04:24,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {3480#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3480#true} is VALID [2022-04-15 13:04:24,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {3480#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {3485#(= main_~z~0 0)} is VALID [2022-04-15 13:04:24,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {3485#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3486#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:24,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {3486#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3487#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:24,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {3487#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3488#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:24,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {3488#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3489#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:24,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {3489#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3490#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:24,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {3490#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3491#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:24,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {3491#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3492#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:24,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {3492#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3493#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:24,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {3493#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3494#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:24,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 < 268435455); {3481#false} is VALID [2022-04-15 13:04:24,390 INFO L272 TraceCheckUtils]: 18: Hoare triple {3481#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {3481#false} is VALID [2022-04-15 13:04:24,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {3481#false} ~cond := #in~cond; {3481#false} is VALID [2022-04-15 13:04:24,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {3481#false} assume 0 == ~cond; {3481#false} is VALID [2022-04-15 13:04:24,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {3481#false} assume !false; {3481#false} is VALID [2022-04-15 13:04:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:24,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:24,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799919038] [2022-04-15 13:04:24,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799919038] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:24,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474172328] [2022-04-15 13:04:24,391 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:04:24,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:24,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:24,392 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:24,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 13:04:24,433 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 13:04:24,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:24,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 13:04:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:24,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:24,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {3480#true} call ULTIMATE.init(); {3480#true} is VALID [2022-04-15 13:04:24,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {3480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3480#true} is VALID [2022-04-15 13:04:24,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {3480#true} assume true; {3480#true} is VALID [2022-04-15 13:04:24,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3480#true} {3480#true} #63#return; {3480#true} is VALID [2022-04-15 13:04:24,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {3480#true} call #t~ret7 := main(); {3480#true} is VALID [2022-04-15 13:04:24,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {3480#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3480#true} is VALID [2022-04-15 13:04:24,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {3480#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3480#true} is VALID [2022-04-15 13:04:24,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {3480#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {3485#(= main_~z~0 0)} is VALID [2022-04-15 13:04:24,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {3485#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3486#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:24,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {3486#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3487#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:24,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {3487#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3488#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:24,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {3488#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3489#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:24,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {3489#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3490#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:24,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {3490#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3491#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:24,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {3491#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3492#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:24,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {3492#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3493#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:24,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {3493#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3547#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:24,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {3547#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 < 268435455); {3481#false} is VALID [2022-04-15 13:04:24,567 INFO L272 TraceCheckUtils]: 18: Hoare triple {3481#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {3481#false} is VALID [2022-04-15 13:04:24,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {3481#false} ~cond := #in~cond; {3481#false} is VALID [2022-04-15 13:04:24,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {3481#false} assume 0 == ~cond; {3481#false} is VALID [2022-04-15 13:04:24,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {3481#false} assume !false; {3481#false} is VALID [2022-04-15 13:04:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:24,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:24,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {3481#false} assume !false; {3481#false} is VALID [2022-04-15 13:04:24,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {3566#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3481#false} is VALID [2022-04-15 13:04:24,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {3570#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3566#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:04:24,992 INFO L272 TraceCheckUtils]: 18: Hoare triple {3574#(= (mod main_~z~0 4) 0)} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {3570#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:04:24,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {3578#(or (< (mod main_~z~0 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !(~z~0 % 4294967296 < 268435455); {3574#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:04:24,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {3582#(or (< (mod (+ main_~z~0 1) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3578#(or (< (mod main_~z~0 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:04:24,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {3586#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 2) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3582#(or (< (mod (+ main_~z~0 1) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:04:24,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {3590#(or (< (mod (+ main_~z~0 3) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3586#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 2) 4294967296) 268435455))} is VALID [2022-04-15 13:04:25,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {3594#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 4) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3590#(or (< (mod (+ main_~z~0 3) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:04:25,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {3598#(or (< (mod (+ 5 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3594#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 4) 4294967296) 268435455))} is VALID [2022-04-15 13:04:25,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {3602#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 6) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3598#(or (< (mod (+ 5 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:04:25,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {3606#(or (< (mod (+ 7 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3602#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 6) 4294967296) 268435455))} is VALID [2022-04-15 13:04:25,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {3610#(or (< (mod (+ main_~z~0 8) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3606#(or (< (mod (+ 7 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:04:25,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {3614#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ main_~z~0 9) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3610#(or (< (mod (+ main_~z~0 8) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:04:25,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {3480#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {3614#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ main_~z~0 9) 4294967296) 268435455))} is VALID [2022-04-15 13:04:25,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {3480#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3480#true} is VALID [2022-04-15 13:04:25,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {3480#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3480#true} is VALID [2022-04-15 13:04:25,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {3480#true} call #t~ret7 := main(); {3480#true} is VALID [2022-04-15 13:04:25,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3480#true} {3480#true} #63#return; {3480#true} is VALID [2022-04-15 13:04:25,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {3480#true} assume true; {3480#true} is VALID [2022-04-15 13:04:25,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {3480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3480#true} is VALID [2022-04-15 13:04:25,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {3480#true} call ULTIMATE.init(); {3480#true} is VALID [2022-04-15 13:04:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:25,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474172328] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:25,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:25,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 27 [2022-04-15 13:04:25,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:25,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [83584431] [2022-04-15 13:04:25,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [83584431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:25,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:25,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:04:25,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687021864] [2022-04-15 13:04:25,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:25,011 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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 22 [2022-04-15 13:04:25,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:25,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-15 13:04:25,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:25,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 13:04:25,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:25,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 13:04:25,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:04:25,028 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-15 13:04:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:25,566 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-15 13:04:25,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 13:04:25,567 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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 22 [2022-04-15 13:04:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-15 13:04:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2022-04-15 13:04:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-15 13:04:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2022-04-15 13:04:25,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 55 transitions. [2022-04-15 13:04:25,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:25,610 INFO L225 Difference]: With dead ends: 57 [2022-04-15 13:04:25,610 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 13:04:25,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=338, Invalid=994, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 13:04:25,620 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:25,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 63 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:04:25,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 13:04:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-15 13:04:25,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:25,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:25,634 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:25,634 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:25,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:25,635 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 13:04:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 13:04:25,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:25,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:25,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-15 13:04:25,635 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-15 13:04:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:25,636 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 13:04:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 13:04:25,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:25,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:25,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:25,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-15 13:04:25,637 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2022-04-15 13:04:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:25,637 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-15 13:04:25,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-15 13:04:25,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-15 13:04:25,670 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-15 13:04:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 13:04:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 13:04:25,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:25,670 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:25,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:25,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:25,883 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:25,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1655539902, now seen corresponding path program 19 times [2022-04-15 13:04:25,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:25,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1240478684] [2022-04-15 13:04:25,918 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash 253438979, now seen corresponding path program 1 times [2022-04-15 13:04:25,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:25,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660081408] [2022-04-15 13:04:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:25,928 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:25,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:25,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1655539902, now seen corresponding path program 20 times [2022-04-15 13:04:25,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:25,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464150985] [2022-04-15 13:04:25,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:25,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:26,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:26,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {3922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3906#true} is VALID [2022-04-15 13:04:26,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-04-15 13:04:26,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3906#true} {3906#true} #63#return; {3906#true} is VALID [2022-04-15 13:04:26,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {3906#true} call ULTIMATE.init(); {3922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:26,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {3922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3906#true} is VALID [2022-04-15 13:04:26,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-04-15 13:04:26,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3906#true} {3906#true} #63#return; {3906#true} is VALID [2022-04-15 13:04:26,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {3906#true} call #t~ret7 := main(); {3906#true} is VALID [2022-04-15 13:04:26,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {3906#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3906#true} is VALID [2022-04-15 13:04:26,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {3906#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3906#true} is VALID [2022-04-15 13:04:26,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {3906#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {3911#(= main_~z~0 0)} is VALID [2022-04-15 13:04:26,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {3911#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3912#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:26,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {3912#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3913#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:26,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {3913#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3914#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:26,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {3914#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3915#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:26,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {3915#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3916#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:26,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {3916#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3917#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:26,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {3917#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3918#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:26,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {3918#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3919#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:26,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {3919#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3920#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:26,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {3920#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3921#(and (<= main_~z~0 10) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:04:26,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {3921#(and (<= main_~z~0 10) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {3907#false} is VALID [2022-04-15 13:04:26,106 INFO L272 TraceCheckUtils]: 19: Hoare triple {3907#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {3907#false} is VALID [2022-04-15 13:04:26,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {3907#false} ~cond := #in~cond; {3907#false} is VALID [2022-04-15 13:04:26,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {3907#false} assume 0 == ~cond; {3907#false} is VALID [2022-04-15 13:04:26,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {3907#false} assume !false; {3907#false} is VALID [2022-04-15 13:04:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:26,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:26,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464150985] [2022-04-15 13:04:26,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464150985] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:26,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316181911] [2022-04-15 13:04:26,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:04:26,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:26,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:26,108 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:26,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 13:04:26,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:04:26,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:26,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 13:04:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:26,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:26,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {3906#true} call ULTIMATE.init(); {3906#true} is VALID [2022-04-15 13:04:26,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {3906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3906#true} is VALID [2022-04-15 13:04:26,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-04-15 13:04:26,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3906#true} {3906#true} #63#return; {3906#true} is VALID [2022-04-15 13:04:26,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {3906#true} call #t~ret7 := main(); {3906#true} is VALID [2022-04-15 13:04:26,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {3906#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3906#true} is VALID [2022-04-15 13:04:26,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {3906#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3906#true} is VALID [2022-04-15 13:04:26,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {3906#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {3911#(= main_~z~0 0)} is VALID [2022-04-15 13:04:26,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {3911#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3912#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:26,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {3912#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3913#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:26,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {3913#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3914#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:26,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {3914#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3915#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:26,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {3915#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3916#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:26,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {3916#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3917#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:26,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {3917#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3918#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:26,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {3918#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3919#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:26,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {3919#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3920#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:26,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {3920#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3977#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:26,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {3977#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {3907#false} is VALID [2022-04-15 13:04:26,387 INFO L272 TraceCheckUtils]: 19: Hoare triple {3907#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {3907#false} is VALID [2022-04-15 13:04:26,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {3907#false} ~cond := #in~cond; {3907#false} is VALID [2022-04-15 13:04:26,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {3907#false} assume 0 == ~cond; {3907#false} is VALID [2022-04-15 13:04:26,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {3907#false} assume !false; {3907#false} is VALID [2022-04-15 13:04:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:26,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:26,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {3907#false} assume !false; {3907#false} is VALID [2022-04-15 13:04:26,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {3907#false} assume 0 == ~cond; {3907#false} is VALID [2022-04-15 13:04:26,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {3907#false} ~cond := #in~cond; {3907#false} is VALID [2022-04-15 13:04:26,708 INFO L272 TraceCheckUtils]: 19: Hoare triple {3907#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {3907#false} is VALID [2022-04-15 13:04:26,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {4005#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {3907#false} is VALID [2022-04-15 13:04:26,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {4009#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4005#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:26,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {4013#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4009#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:26,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {4017#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4013#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:26,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {4021#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4017#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:26,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {4025#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4021#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:26,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {4029#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4025#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:26,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {4033#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4029#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:04:26,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {4037#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4033#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:26,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {4041#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4037#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:04:26,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {4045#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4041#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:04:26,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {3906#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {4045#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:04:26,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {3906#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3906#true} is VALID [2022-04-15 13:04:26,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {3906#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3906#true} is VALID [2022-04-15 13:04:26,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {3906#true} call #t~ret7 := main(); {3906#true} is VALID [2022-04-15 13:04:26,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3906#true} {3906#true} #63#return; {3906#true} is VALID [2022-04-15 13:04:26,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {3906#true} assume true; {3906#true} is VALID [2022-04-15 13:04:26,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {3906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3906#true} is VALID [2022-04-15 13:04:26,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {3906#true} call ULTIMATE.init(); {3906#true} is VALID [2022-04-15 13:04:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:26,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316181911] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:26,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:26,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 13:04:26,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:26,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1240478684] [2022-04-15 13:04:26,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1240478684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:26,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:26,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 13:04:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406728793] [2022-04-15 13:04:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:26,729 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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 23 [2022-04-15 13:04:26,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:26,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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-15 13:04:26,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:26,744 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 13:04:26,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:26,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 13:04:26,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-15 13:04:26,745 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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-15 13:04:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:27,248 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-15 13:04:27,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 13:04:27,248 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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 23 [2022-04-15 13:04:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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-15 13:04:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-15 13:04:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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-15 13:04:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-15 13:04:27,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2022-04-15 13:04:27,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:27,297 INFO L225 Difference]: With dead ends: 59 [2022-04-15 13:04:27,297 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 13:04:27,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 13:04:27,298 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:27,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:04:27,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 13:04:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-15 13:04:27,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:27,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:27,322 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:27,322 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:27,323 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 13:04:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 13:04:27,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:27,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:27,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-15 13:04:27,323 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-15 13:04:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:27,325 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 13:04:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 13:04:27,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:27,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:27,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:27,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-15 13:04:27,326 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2022-04-15 13:04:27,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:27,326 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-15 13:04:27,327 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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-15 13:04:27,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-15 13:04:27,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 13:04:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 13:04:27,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:27,361 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:27,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:27,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23 [2022-04-15 13:04:27,563 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:27,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:27,564 INFO L85 PathProgramCache]: Analyzing trace with hash 244173154, now seen corresponding path program 21 times [2022-04-15 13:04:27,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:27,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1971451330] [2022-04-15 13:04:27,609 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:27,610 INFO L85 PathProgramCache]: Analyzing trace with hash 312544323, now seen corresponding path program 1 times [2022-04-15 13:04:27,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:27,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946488848] [2022-04-15 13:04:27,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:27,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:27,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:27,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:27,631 INFO L85 PathProgramCache]: Analyzing trace with hash 244173154, now seen corresponding path program 22 times [2022-04-15 13:04:27,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:27,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637161089] [2022-04-15 13:04:27,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:27,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:27,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:27,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {4364#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4347#true} is VALID [2022-04-15 13:04:27,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {4347#true} assume true; {4347#true} is VALID [2022-04-15 13:04:27,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4347#true} {4347#true} #63#return; {4347#true} is VALID [2022-04-15 13:04:27,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {4347#true} call ULTIMATE.init(); {4364#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:27,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {4364#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4347#true} is VALID [2022-04-15 13:04:27,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {4347#true} assume true; {4347#true} is VALID [2022-04-15 13:04:27,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4347#true} {4347#true} #63#return; {4347#true} is VALID [2022-04-15 13:04:27,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {4347#true} call #t~ret7 := main(); {4347#true} is VALID [2022-04-15 13:04:27,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {4347#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4347#true} is VALID [2022-04-15 13:04:27,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {4347#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4347#true} is VALID [2022-04-15 13:04:27,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {4347#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {4352#(= main_~z~0 0)} is VALID [2022-04-15 13:04:27,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {4352#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4353#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:27,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {4353#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4354#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:27,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {4354#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4355#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:27,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {4355#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4356#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:27,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {4356#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4357#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:27,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {4357#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4358#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:27,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {4358#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4359#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:27,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {4359#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4360#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:27,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {4360#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4361#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:27,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {4361#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4362#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:27,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {4362#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4363#(and (<= main_~z~0 11) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:04:27,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {4363#(and (<= main_~z~0 11) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {4348#false} is VALID [2022-04-15 13:04:27,813 INFO L272 TraceCheckUtils]: 20: Hoare triple {4348#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {4348#false} is VALID [2022-04-15 13:04:27,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {4348#false} ~cond := #in~cond; {4348#false} is VALID [2022-04-15 13:04:27,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {4348#false} assume 0 == ~cond; {4348#false} is VALID [2022-04-15 13:04:27,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {4348#false} assume !false; {4348#false} is VALID [2022-04-15 13:04:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:27,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:27,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637161089] [2022-04-15 13:04:27,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637161089] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:27,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907094602] [2022-04-15 13:04:27,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:04:27,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:27,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:27,815 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:27,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 13:04:27,853 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:04:27,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:27,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 13:04:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:27,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:28,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {4347#true} call ULTIMATE.init(); {4347#true} is VALID [2022-04-15 13:04:28,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {4347#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4347#true} is VALID [2022-04-15 13:04:28,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {4347#true} assume true; {4347#true} is VALID [2022-04-15 13:04:28,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4347#true} {4347#true} #63#return; {4347#true} is VALID [2022-04-15 13:04:28,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {4347#true} call #t~ret7 := main(); {4347#true} is VALID [2022-04-15 13:04:28,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {4347#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4347#true} is VALID [2022-04-15 13:04:28,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {4347#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4347#true} is VALID [2022-04-15 13:04:28,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {4347#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {4352#(= main_~z~0 0)} is VALID [2022-04-15 13:04:28,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {4352#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4353#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:28,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {4353#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4354#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:28,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {4354#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4355#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:28,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {4355#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4356#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:28,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {4356#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4357#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:28,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {4357#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4358#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:28,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {4358#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4359#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:28,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {4359#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4360#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:28,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {4360#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4361#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:28,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {4361#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4362#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:28,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {4362#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4422#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:28,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {4422#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {4348#false} is VALID [2022-04-15 13:04:28,079 INFO L272 TraceCheckUtils]: 20: Hoare triple {4348#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {4348#false} is VALID [2022-04-15 13:04:28,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {4348#false} ~cond := #in~cond; {4348#false} is VALID [2022-04-15 13:04:28,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {4348#false} assume 0 == ~cond; {4348#false} is VALID [2022-04-15 13:04:28,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {4348#false} assume !false; {4348#false} is VALID [2022-04-15 13:04:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:28,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:28,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {4348#false} assume !false; {4348#false} is VALID [2022-04-15 13:04:28,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {4348#false} assume 0 == ~cond; {4348#false} is VALID [2022-04-15 13:04:28,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {4348#false} ~cond := #in~cond; {4348#false} is VALID [2022-04-15 13:04:28,421 INFO L272 TraceCheckUtils]: 20: Hoare triple {4348#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {4348#false} is VALID [2022-04-15 13:04:28,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {4450#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {4348#false} is VALID [2022-04-15 13:04:28,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {4454#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4450#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:28,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {4458#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4454#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:28,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {4462#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4458#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:28,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {4466#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4462#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:28,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {4470#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4466#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:28,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {4474#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4470#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:28,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {4478#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4474#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:04:28,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {4482#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4478#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:28,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {4486#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4482#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:04:28,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {4490#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4486#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:04:28,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {4494#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4490#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:04:28,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {4347#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {4494#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:04:28,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {4347#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4347#true} is VALID [2022-04-15 13:04:28,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {4347#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4347#true} is VALID [2022-04-15 13:04:28,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {4347#true} call #t~ret7 := main(); {4347#true} is VALID [2022-04-15 13:04:28,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4347#true} {4347#true} #63#return; {4347#true} is VALID [2022-04-15 13:04:28,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {4347#true} assume true; {4347#true} is VALID [2022-04-15 13:04:28,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {4347#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4347#true} is VALID [2022-04-15 13:04:28,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {4347#true} call ULTIMATE.init(); {4347#true} is VALID [2022-04-15 13:04:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:28,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907094602] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:28,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:28,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-15 13:04:28,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:28,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1971451330] [2022-04-15 13:04:28,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1971451330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:28,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:28,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 13:04:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106290988] [2022-04-15 13:04:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:28,444 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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 24 [2022-04-15 13:04:28,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:28,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-15 13:04:28,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:28,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 13:04:28,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:28,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 13:04:28,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-04-15 13:04:28,461 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-15 13:04:29,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:29,115 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-15 13:04:29,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 13:04:29,115 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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 24 [2022-04-15 13:04:29,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-15 13:04:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2022-04-15 13:04:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-15 13:04:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2022-04-15 13:04:29,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 57 transitions. [2022-04-15 13:04:29,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:29,165 INFO L225 Difference]: With dead ends: 61 [2022-04-15 13:04:29,165 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 13:04:29,166 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 13:04:29,166 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:29,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 63 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:04:29,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 13:04:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 13:04:29,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:29,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:29,186 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:29,186 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:29,186 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 13:04:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 13:04:29,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:29,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:29,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-15 13:04:29,187 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-15 13:04:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:29,188 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 13:04:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 13:04:29,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:29,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:29,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:29,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-15 13:04:29,191 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 24 [2022-04-15 13:04:29,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:29,191 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-15 13:04:29,191 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-15 13:04:29,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-15 13:04:29,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 13:04:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:04:29,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:29,227 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:29,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:29,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25 [2022-04-15 13:04:29,428 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash -994264254, now seen corresponding path program 23 times [2022-04-15 13:04:29,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:29,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1594689021] [2022-04-15 13:04:29,463 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash 371649667, now seen corresponding path program 1 times [2022-04-15 13:04:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:29,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701479680] [2022-04-15 13:04:29,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:29,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:29,471 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:29,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:29,476 INFO L85 PathProgramCache]: Analyzing trace with hash -994264254, now seen corresponding path program 24 times [2022-04-15 13:04:29,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:29,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948291801] [2022-04-15 13:04:29,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:29,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:29,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:29,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {4824#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4806#true} is VALID [2022-04-15 13:04:29,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {4806#true} assume true; {4806#true} is VALID [2022-04-15 13:04:29,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4806#true} {4806#true} #63#return; {4806#true} is VALID [2022-04-15 13:04:29,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {4806#true} call ULTIMATE.init(); {4824#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:29,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {4824#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4806#true} is VALID [2022-04-15 13:04:29,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {4806#true} assume true; {4806#true} is VALID [2022-04-15 13:04:29,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4806#true} {4806#true} #63#return; {4806#true} is VALID [2022-04-15 13:04:29,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {4806#true} call #t~ret7 := main(); {4806#true} is VALID [2022-04-15 13:04:29,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {4806#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4806#true} is VALID [2022-04-15 13:04:29,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {4806#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4806#true} is VALID [2022-04-15 13:04:29,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {4806#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {4811#(= main_~z~0 0)} is VALID [2022-04-15 13:04:29,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {4811#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4812#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:29,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {4812#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4813#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:29,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {4813#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4814#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:29,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {4814#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4815#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:29,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {4815#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4816#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:29,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {4816#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4817#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:29,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {4817#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4818#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:29,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {4818#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4819#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:29,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {4819#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4820#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:29,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {4820#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4821#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:29,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {4821#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4822#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:29,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {4822#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4823#(and (<= main_~z~0 12) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:04:29,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {4823#(and (<= main_~z~0 12) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {4807#false} is VALID [2022-04-15 13:04:29,668 INFO L272 TraceCheckUtils]: 21: Hoare triple {4807#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {4807#false} is VALID [2022-04-15 13:04:29,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {4807#false} ~cond := #in~cond; {4807#false} is VALID [2022-04-15 13:04:29,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {4807#false} assume 0 == ~cond; {4807#false} is VALID [2022-04-15 13:04:29,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {4807#false} assume !false; {4807#false} is VALID [2022-04-15 13:04:29,668 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:29,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:29,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948291801] [2022-04-15 13:04:29,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948291801] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:29,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741179715] [2022-04-15 13:04:29,669 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:04:29,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:29,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:29,670 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:29,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 13:04:29,734 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 13:04:29,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:29,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 13:04:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:29,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:30,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {4806#true} call ULTIMATE.init(); {4806#true} is VALID [2022-04-15 13:04:30,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {4806#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4806#true} is VALID [2022-04-15 13:04:30,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {4806#true} assume true; {4806#true} is VALID [2022-04-15 13:04:30,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4806#true} {4806#true} #63#return; {4806#true} is VALID [2022-04-15 13:04:30,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {4806#true} call #t~ret7 := main(); {4806#true} is VALID [2022-04-15 13:04:30,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {4806#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4806#true} is VALID [2022-04-15 13:04:30,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {4806#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4806#true} is VALID [2022-04-15 13:04:30,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {4806#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {4811#(= main_~z~0 0)} is VALID [2022-04-15 13:04:30,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {4811#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4812#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:30,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {4812#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4813#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:30,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {4813#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4814#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:30,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {4814#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4815#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:30,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {4815#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4816#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:30,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {4816#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4817#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:30,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {4817#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4818#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:30,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {4818#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4819#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:30,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {4819#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4820#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:30,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {4820#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4821#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:30,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {4821#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4822#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:30,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {4822#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4885#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:30,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {4885#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {4807#false} is VALID [2022-04-15 13:04:30,012 INFO L272 TraceCheckUtils]: 21: Hoare triple {4807#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {4807#false} is VALID [2022-04-15 13:04:30,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {4807#false} ~cond := #in~cond; {4807#false} is VALID [2022-04-15 13:04:30,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {4807#false} assume 0 == ~cond; {4807#false} is VALID [2022-04-15 13:04:30,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {4807#false} assume !false; {4807#false} is VALID [2022-04-15 13:04:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:30,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:30,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {4807#false} assume !false; {4807#false} is VALID [2022-04-15 13:04:30,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {4807#false} assume 0 == ~cond; {4807#false} is VALID [2022-04-15 13:04:30,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {4807#false} ~cond := #in~cond; {4807#false} is VALID [2022-04-15 13:04:30,444 INFO L272 TraceCheckUtils]: 21: Hoare triple {4807#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {4807#false} is VALID [2022-04-15 13:04:30,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {4913#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {4807#false} is VALID [2022-04-15 13:04:30,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4913#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:30,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {4921#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4917#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:30,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {4925#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4921#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:30,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {4929#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4925#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:30,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {4933#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4929#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:30,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {4937#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4933#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:30,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {4941#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4937#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:04:30,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {4945#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4941#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:30,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {4949#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4945#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:04:30,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {4953#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4949#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:04:30,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {4957#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4953#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:04:30,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {4961#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4957#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:04:30,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {4806#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {4961#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:04:30,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {4806#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4806#true} is VALID [2022-04-15 13:04:30,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {4806#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4806#true} is VALID [2022-04-15 13:04:30,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {4806#true} call #t~ret7 := main(); {4806#true} is VALID [2022-04-15 13:04:30,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4806#true} {4806#true} #63#return; {4806#true} is VALID [2022-04-15 13:04:30,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {4806#true} assume true; {4806#true} is VALID [2022-04-15 13:04:30,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {4806#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4806#true} is VALID [2022-04-15 13:04:30,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {4806#true} call ULTIMATE.init(); {4806#true} is VALID [2022-04-15 13:04:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:30,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741179715] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:30,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:30,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-15 13:04:30,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:30,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1594689021] [2022-04-15 13:04:30,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1594689021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:30,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:30,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 13:04:30,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358247482] [2022-04-15 13:04:30,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:30,459 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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 25 [2022-04-15 13:04:30,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:30,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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-15 13:04:30,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:30,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 13:04:30,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:30,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 13:04:30,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2022-04-15 13:04:30,479 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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-15 13:04:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:31,125 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-15 13:04:31,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 13:04:31,125 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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 25 [2022-04-15 13:04:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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-15 13:04:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-15 13:04:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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-15 13:04:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-15 13:04:31,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 58 transitions. [2022-04-15 13:04:31,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:31,172 INFO L225 Difference]: With dead ends: 63 [2022-04-15 13:04:31,172 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 13:04:31,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=497, Invalid=1309, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 13:04:31,173 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:31,174 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 53 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:04:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 13:04:31,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-15 13:04:31,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:31,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:31,197 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:31,197 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:31,198 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 13:04:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-15 13:04:31,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:31,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:31,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-04-15 13:04:31,199 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-04-15 13:04:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:31,199 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 13:04:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-15 13:04:31,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:31,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:31,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:31,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-15 13:04:31,200 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 25 [2022-04-15 13:04:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:31,200 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-15 13:04:31,200 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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-15 13:04:31,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-15 13:04:31,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 13:04:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 13:04:31,242 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:31,242 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:31,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:31,446 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27 [2022-04-15 13:04:31,446 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:31,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash -731118238, now seen corresponding path program 25 times [2022-04-15 13:04:31,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:31,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [157783892] [2022-04-15 13:04:31,476 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:31,478 INFO L85 PathProgramCache]: Analyzing trace with hash 430755011, now seen corresponding path program 1 times [2022-04-15 13:04:31,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:31,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132716100] [2022-04-15 13:04:31,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:31,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:31,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:31,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:31,489 INFO L85 PathProgramCache]: Analyzing trace with hash -731118238, now seen corresponding path program 26 times [2022-04-15 13:04:31,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:31,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154313367] [2022-04-15 13:04:31,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:31,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:31,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:31,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {5302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5283#true} is VALID [2022-04-15 13:04:31,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {5283#true} assume true; {5283#true} is VALID [2022-04-15 13:04:31,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5283#true} {5283#true} #63#return; {5283#true} is VALID [2022-04-15 13:04:31,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {5283#true} call ULTIMATE.init(); {5302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:31,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {5302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5283#true} is VALID [2022-04-15 13:04:31,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {5283#true} assume true; {5283#true} is VALID [2022-04-15 13:04:31,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5283#true} {5283#true} #63#return; {5283#true} is VALID [2022-04-15 13:04:31,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {5283#true} call #t~ret7 := main(); {5283#true} is VALID [2022-04-15 13:04:31,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {5283#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5283#true} is VALID [2022-04-15 13:04:31,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {5283#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5283#true} is VALID [2022-04-15 13:04:31,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {5283#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {5288#(= main_~z~0 0)} is VALID [2022-04-15 13:04:31,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {5288#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5289#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:31,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {5289#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5290#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:31,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {5290#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5291#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:31,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {5291#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5292#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:31,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {5292#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5293#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:31,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {5293#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5294#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:31,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {5294#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5295#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:31,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {5295#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5296#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:31,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {5296#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5297#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:31,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {5297#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5298#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:31,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {5298#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5299#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:31,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {5299#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5300#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:31,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {5300#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5301#(and (<= main_~z~0 13) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:04:31,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {5301#(and (<= main_~z~0 13) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {5284#false} is VALID [2022-04-15 13:04:31,716 INFO L272 TraceCheckUtils]: 22: Hoare triple {5284#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {5284#false} is VALID [2022-04-15 13:04:31,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {5284#false} ~cond := #in~cond; {5284#false} is VALID [2022-04-15 13:04:31,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {5284#false} assume 0 == ~cond; {5284#false} is VALID [2022-04-15 13:04:31,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {5284#false} assume !false; {5284#false} is VALID [2022-04-15 13:04:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:31,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:31,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154313367] [2022-04-15 13:04:31,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154313367] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:31,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939485310] [2022-04-15 13:04:31,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:04:31,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:31,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:31,718 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:31,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 13:04:31,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:04:31,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:31,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 13:04:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:31,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:32,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {5283#true} call ULTIMATE.init(); {5283#true} is VALID [2022-04-15 13:04:32,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {5283#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5283#true} is VALID [2022-04-15 13:04:32,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {5283#true} assume true; {5283#true} is VALID [2022-04-15 13:04:32,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5283#true} {5283#true} #63#return; {5283#true} is VALID [2022-04-15 13:04:32,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {5283#true} call #t~ret7 := main(); {5283#true} is VALID [2022-04-15 13:04:32,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {5283#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5283#true} is VALID [2022-04-15 13:04:32,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {5283#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5283#true} is VALID [2022-04-15 13:04:32,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {5283#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {5288#(= main_~z~0 0)} is VALID [2022-04-15 13:04:32,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {5288#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5289#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:32,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {5289#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5290#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:32,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {5290#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5291#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:32,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {5291#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5292#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:32,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {5292#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5293#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:32,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {5293#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5294#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:32,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {5294#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5295#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:32,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {5295#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5296#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:32,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {5296#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5297#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:32,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {5297#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5298#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:32,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {5298#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5299#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:32,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {5299#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5300#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:32,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {5300#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5366#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:32,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {5366#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 < 268435455); {5284#false} is VALID [2022-04-15 13:04:32,038 INFO L272 TraceCheckUtils]: 22: Hoare triple {5284#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {5284#false} is VALID [2022-04-15 13:04:32,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {5284#false} ~cond := #in~cond; {5284#false} is VALID [2022-04-15 13:04:32,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {5284#false} assume 0 == ~cond; {5284#false} is VALID [2022-04-15 13:04:32,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {5284#false} assume !false; {5284#false} is VALID [2022-04-15 13:04:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:32,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:32,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {5284#false} assume !false; {5284#false} is VALID [2022-04-15 13:04:32,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {5284#false} assume 0 == ~cond; {5284#false} is VALID [2022-04-15 13:04:32,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {5284#false} ~cond := #in~cond; {5284#false} is VALID [2022-04-15 13:04:32,543 INFO L272 TraceCheckUtils]: 22: Hoare triple {5284#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {5284#false} is VALID [2022-04-15 13:04:32,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {5394#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {5284#false} is VALID [2022-04-15 13:04:32,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {5398#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5394#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {5402#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5398#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {5406#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5402#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {5410#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5406#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {5414#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5410#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {5418#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5414#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {5422#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5418#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {5426#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5422#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {5430#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5426#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {5434#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5430#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {5438#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5434#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {5442#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5438#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {5446#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5442#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {5283#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {5446#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:04:32,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {5283#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5283#true} is VALID [2022-04-15 13:04:32,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {5283#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5283#true} is VALID [2022-04-15 13:04:32,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {5283#true} call #t~ret7 := main(); {5283#true} is VALID [2022-04-15 13:04:32,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5283#true} {5283#true} #63#return; {5283#true} is VALID [2022-04-15 13:04:32,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {5283#true} assume true; {5283#true} is VALID [2022-04-15 13:04:32,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {5283#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5283#true} is VALID [2022-04-15 13:04:32,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {5283#true} call ULTIMATE.init(); {5283#true} is VALID [2022-04-15 13:04:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:32,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939485310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:32,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:32,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 13:04:32,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:32,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [157783892] [2022-04-15 13:04:32,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [157783892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:32,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:32,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 13:04:32,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069721381] [2022-04-15 13:04:32,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:32,556 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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 26 [2022-04-15 13:04:32,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:32,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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-15 13:04:32,578 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-15 13:04:32,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 13:04:32,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:32,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 13:04:32,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-04-15 13:04:32,579 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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-15 13:04:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:33,232 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-15 13:04:33,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 13:04:33,232 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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 26 [2022-04-15 13:04:33,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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-15 13:04:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 59 transitions. [2022-04-15 13:04:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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-15 13:04:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 59 transitions. [2022-04-15 13:04:33,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 59 transitions. [2022-04-15 13:04:33,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:33,287 INFO L225 Difference]: With dead ends: 65 [2022-04-15 13:04:33,288 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 13:04:33,288 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=563, Invalid=1507, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 13:04:33,289 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:33,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 43 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:04:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 13:04:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-15 13:04:33,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:33,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:33,314 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:33,314 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:33,315 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-15 13:04:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-15 13:04:33,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:33,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:33,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-04-15 13:04:33,316 INFO L87 Difference]: Start difference. First operand has 36 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-04-15 13:04:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:33,317 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-15 13:04:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-15 13:04:33,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:33,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:33,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:33,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-15 13:04:33,318 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 26 [2022-04-15 13:04:33,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:33,318 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-15 13:04:33,319 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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-15 13:04:33,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 40 transitions. [2022-04-15 13:04:33,361 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-15 13:04:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-15 13:04:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 13:04:33,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:33,361 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:33,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:33,562 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 13:04:33,562 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:33,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:33,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1163526334, now seen corresponding path program 27 times [2022-04-15 13:04:33,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:33,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1793540019] [2022-04-15 13:04:33,594 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:33,595 INFO L85 PathProgramCache]: Analyzing trace with hash 489860355, now seen corresponding path program 1 times [2022-04-15 13:04:33,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:33,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199000090] [2022-04-15 13:04:33,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:33,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:33,601 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:33,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:33,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1163526334, now seen corresponding path program 28 times [2022-04-15 13:04:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:33,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204740427] [2022-04-15 13:04:33,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:33,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:33,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:33,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {5798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5778#true} is VALID [2022-04-15 13:04:33,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {5778#true} assume true; {5778#true} is VALID [2022-04-15 13:04:33,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5778#true} {5778#true} #63#return; {5778#true} is VALID [2022-04-15 13:04:33,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {5778#true} call ULTIMATE.init(); {5798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:33,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {5798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5778#true} is VALID [2022-04-15 13:04:33,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {5778#true} assume true; {5778#true} is VALID [2022-04-15 13:04:33,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5778#true} {5778#true} #63#return; {5778#true} is VALID [2022-04-15 13:04:33,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {5778#true} call #t~ret7 := main(); {5778#true} is VALID [2022-04-15 13:04:33,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {5778#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5778#true} is VALID [2022-04-15 13:04:33,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {5778#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5778#true} is VALID [2022-04-15 13:04:33,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {5778#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {5783#(= main_~z~0 0)} is VALID [2022-04-15 13:04:33,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {5783#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5784#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:33,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {5784#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5785#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:33,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {5785#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5786#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:33,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {5786#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5787#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:33,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {5787#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5788#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:33,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {5788#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5789#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:33,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {5789#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5790#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:33,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {5790#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5791#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:33,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {5791#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5792#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:33,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {5792#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5793#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:33,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {5793#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5794#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:33,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {5794#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5795#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:33,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {5795#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5796#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:33,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {5796#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5797#(and (<= main_~z~0 14) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:04:33,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {5797#(and (<= main_~z~0 14) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {5779#false} is VALID [2022-04-15 13:04:33,849 INFO L272 TraceCheckUtils]: 23: Hoare triple {5779#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {5779#false} is VALID [2022-04-15 13:04:33,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {5779#false} ~cond := #in~cond; {5779#false} is VALID [2022-04-15 13:04:33,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {5779#false} assume 0 == ~cond; {5779#false} is VALID [2022-04-15 13:04:33,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {5779#false} assume !false; {5779#false} is VALID [2022-04-15 13:04:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:33,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:33,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204740427] [2022-04-15 13:04:33,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204740427] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:33,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007941464] [2022-04-15 13:04:33,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:04:33,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:33,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:33,851 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:33,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 13:04:33,897 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:04:33,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:33,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 13:04:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:33,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:34,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {5778#true} call ULTIMATE.init(); {5778#true} is VALID [2022-04-15 13:04:34,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {5778#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5778#true} is VALID [2022-04-15 13:04:34,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {5778#true} assume true; {5778#true} is VALID [2022-04-15 13:04:34,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5778#true} {5778#true} #63#return; {5778#true} is VALID [2022-04-15 13:04:34,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {5778#true} call #t~ret7 := main(); {5778#true} is VALID [2022-04-15 13:04:34,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {5778#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5778#true} is VALID [2022-04-15 13:04:34,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {5778#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5778#true} is VALID [2022-04-15 13:04:34,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {5778#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {5783#(= main_~z~0 0)} is VALID [2022-04-15 13:04:34,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {5783#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5784#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:34,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {5784#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5785#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:34,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {5785#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5786#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:34,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {5786#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5787#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:34,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {5787#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5788#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:34,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {5788#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5789#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:34,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {5789#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5790#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:34,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {5790#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5791#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:34,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {5791#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5792#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:34,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {5792#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5793#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:34,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {5793#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5794#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:34,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {5794#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5795#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:34,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {5795#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5796#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:34,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {5796#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5865#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:34,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {5865#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 < 268435455); {5779#false} is VALID [2022-04-15 13:04:34,156 INFO L272 TraceCheckUtils]: 23: Hoare triple {5779#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {5779#false} is VALID [2022-04-15 13:04:34,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {5779#false} ~cond := #in~cond; {5779#false} is VALID [2022-04-15 13:04:34,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {5779#false} assume 0 == ~cond; {5779#false} is VALID [2022-04-15 13:04:34,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {5779#false} assume !false; {5779#false} is VALID [2022-04-15 13:04:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:34,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:34,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {5779#false} assume !false; {5779#false} is VALID [2022-04-15 13:04:34,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {5779#false} assume 0 == ~cond; {5779#false} is VALID [2022-04-15 13:04:34,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {5779#false} ~cond := #in~cond; {5779#false} is VALID [2022-04-15 13:04:34,731 INFO L272 TraceCheckUtils]: 23: Hoare triple {5779#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {5779#false} is VALID [2022-04-15 13:04:34,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {5893#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {5779#false} is VALID [2022-04-15 13:04:34,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {5897#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5893#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {5901#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5897#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {5905#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5901#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {5909#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5905#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {5913#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5909#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {5917#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5913#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {5921#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5917#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {5925#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5921#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {5929#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5925#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {5933#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5929#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {5937#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5933#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {5941#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5937#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {5945#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5941#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {5949#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5945#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {5778#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {5949#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:04:34,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {5778#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5778#true} is VALID [2022-04-15 13:04:34,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {5778#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5778#true} is VALID [2022-04-15 13:04:34,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {5778#true} call #t~ret7 := main(); {5778#true} is VALID [2022-04-15 13:04:34,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5778#true} {5778#true} #63#return; {5778#true} is VALID [2022-04-15 13:04:34,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {5778#true} assume true; {5778#true} is VALID [2022-04-15 13:04:34,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {5778#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5778#true} is VALID [2022-04-15 13:04:34,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {5778#true} call ULTIMATE.init(); {5778#true} is VALID [2022-04-15 13:04:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:34,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007941464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:34,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:34,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-15 13:04:34,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:34,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1793540019] [2022-04-15 13:04:34,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1793540019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:34,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:34,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 13:04:34,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827034524] [2022-04-15 13:04:34,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:34,747 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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 27 [2022-04-15 13:04:34,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:34,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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-15 13:04:34,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:34,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 13:04:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:34,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 13:04:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 13:04:34,767 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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-15 13:04:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:35,603 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-04-15 13:04:35,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 13:04:35,603 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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 27 [2022-04-15 13:04:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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-15 13:04:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-04-15 13:04:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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-15 13:04:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-04-15 13:04:35,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 60 transitions. [2022-04-15 13:04:35,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:35,660 INFO L225 Difference]: With dead ends: 67 [2022-04-15 13:04:35,660 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 13:04:35,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=633, Invalid=1719, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 13:04:35,661 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:35,662 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 58 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 13:04:35,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 13:04:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-15 13:04:35,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:35,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:35,687 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:35,687 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:35,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:35,688 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 13:04:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 13:04:35,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:35,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:35,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-04-15 13:04:35,688 INFO L87 Difference]: Start difference. First operand has 37 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-04-15 13:04:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:35,689 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 13:04:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 13:04:35,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:35,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:35,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:35,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-04-15 13:04:35,690 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 27 [2022-04-15 13:04:35,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:35,690 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-04-15 13:04:35,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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-15 13:04:35,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2022-04-15 13:04:35,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-15 13:04:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 13:04:35,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:35,738 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:35,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:35,938 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:35,939 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:35,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:35,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1683275422, now seen corresponding path program 29 times [2022-04-15 13:04:35,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:35,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1422912990] [2022-04-15 13:04:35,975 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:35,976 INFO L85 PathProgramCache]: Analyzing trace with hash 548965699, now seen corresponding path program 1 times [2022-04-15 13:04:35,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:35,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158793136] [2022-04-15 13:04:35,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:35,984 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:35,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:35,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1683275422, now seen corresponding path program 30 times [2022-04-15 13:04:35,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:35,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161795140] [2022-04-15 13:04:35,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:35,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:36,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:36,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {6312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6291#true} is VALID [2022-04-15 13:04:36,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {6291#true} assume true; {6291#true} is VALID [2022-04-15 13:04:36,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6291#true} {6291#true} #63#return; {6291#true} is VALID [2022-04-15 13:04:36,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {6291#true} call ULTIMATE.init(); {6312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:36,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {6312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6291#true} is VALID [2022-04-15 13:04:36,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {6291#true} assume true; {6291#true} is VALID [2022-04-15 13:04:36,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6291#true} {6291#true} #63#return; {6291#true} is VALID [2022-04-15 13:04:36,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {6291#true} call #t~ret7 := main(); {6291#true} is VALID [2022-04-15 13:04:36,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {6291#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {6291#true} is VALID [2022-04-15 13:04:36,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {6291#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6291#true} is VALID [2022-04-15 13:04:36,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {6291#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {6296#(= main_~z~0 0)} is VALID [2022-04-15 13:04:36,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {6296#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6297#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:36,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {6297#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6298#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:36,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {6298#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6299#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:36,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {6299#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6300#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:36,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {6300#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6301#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:36,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {6301#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6302#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:36,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {6302#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6303#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:36,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {6303#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6304#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:36,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {6304#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6305#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:36,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {6305#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6306#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:36,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {6306#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6307#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:36,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {6307#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6308#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:36,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {6308#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6309#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:36,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {6309#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6310#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:36,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {6310#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6311#(and (<= main_~z~0 15) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:04:36,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {6311#(and (<= main_~z~0 15) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {6292#false} is VALID [2022-04-15 13:04:36,231 INFO L272 TraceCheckUtils]: 24: Hoare triple {6292#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {6292#false} is VALID [2022-04-15 13:04:36,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {6292#false} ~cond := #in~cond; {6292#false} is VALID [2022-04-15 13:04:36,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {6292#false} assume 0 == ~cond; {6292#false} is VALID [2022-04-15 13:04:36,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {6292#false} assume !false; {6292#false} is VALID [2022-04-15 13:04:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:36,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:36,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161795140] [2022-04-15 13:04:36,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161795140] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:36,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495111987] [2022-04-15 13:04:36,231 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:04:36,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:36,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:36,232 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:36,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 13:04:36,395 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 13:04:36,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:36,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 13:04:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:36,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:36,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {6291#true} call ULTIMATE.init(); {6291#true} is VALID [2022-04-15 13:04:36,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {6291#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6291#true} is VALID [2022-04-15 13:04:36,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {6291#true} assume true; {6291#true} is VALID [2022-04-15 13:04:36,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6291#true} {6291#true} #63#return; {6291#true} is VALID [2022-04-15 13:04:36,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {6291#true} call #t~ret7 := main(); {6291#true} is VALID [2022-04-15 13:04:36,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {6291#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {6291#true} is VALID [2022-04-15 13:04:36,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {6291#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6291#true} is VALID [2022-04-15 13:04:36,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {6291#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {6296#(= main_~z~0 0)} is VALID [2022-04-15 13:04:36,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {6296#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6297#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:36,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {6297#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6298#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:36,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {6298#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6299#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:36,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {6299#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6300#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:36,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {6300#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6301#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:36,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {6301#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6302#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:36,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {6302#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6303#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:36,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {6303#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6304#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:36,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {6304#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6305#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:36,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {6305#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6306#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:36,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {6306#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6307#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:36,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {6307#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6308#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:36,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {6308#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6309#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:36,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {6309#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6310#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:36,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {6310#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6382#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:04:36,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {6382#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {6292#false} is VALID [2022-04-15 13:04:36,637 INFO L272 TraceCheckUtils]: 24: Hoare triple {6292#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {6292#false} is VALID [2022-04-15 13:04:36,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {6292#false} ~cond := #in~cond; {6292#false} is VALID [2022-04-15 13:04:36,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {6292#false} assume 0 == ~cond; {6292#false} is VALID [2022-04-15 13:04:36,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {6292#false} assume !false; {6292#false} is VALID [2022-04-15 13:04:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:36,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:37,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {6292#false} assume !false; {6292#false} is VALID [2022-04-15 13:04:37,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {6401#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6292#false} is VALID [2022-04-15 13:04:37,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {6405#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6401#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:04:37,565 INFO L272 TraceCheckUtils]: 24: Hoare triple {6409#(= (mod main_~z~0 4) 0)} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {6405#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:04:37,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {6413#(or (< (mod main_~z~0 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !(~z~0 % 4294967296 < 268435455); {6409#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:04:37,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {6417#(or (< (mod (+ main_~z~0 1) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6413#(or (< (mod main_~z~0 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:04:37,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {6421#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 2) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6417#(or (< (mod (+ main_~z~0 1) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:04:37,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {6425#(or (< (mod (+ main_~z~0 3) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6421#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 2) 4294967296) 268435455))} is VALID [2022-04-15 13:04:37,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {6429#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 4) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6425#(or (< (mod (+ main_~z~0 3) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:04:37,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {6433#(or (< (mod (+ 5 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6429#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 4) 4294967296) 268435455))} is VALID [2022-04-15 13:04:37,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {6437#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 6) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6433#(or (< (mod (+ 5 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:04:37,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {6441#(or (< (mod (+ 7 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6437#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 6) 4294967296) 268435455))} is VALID [2022-04-15 13:04:37,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {6445#(or (< (mod (+ main_~z~0 8) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6441#(or (< (mod (+ 7 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:04:37,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {6449#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ main_~z~0 9) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6445#(or (< (mod (+ main_~z~0 8) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:04:37,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {6453#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 10) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6449#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ main_~z~0 9) 4294967296) 268435455))} is VALID [2022-04-15 13:04:37,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {6457#(or (< (mod (+ main_~z~0 11) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6453#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 10) 4294967296) 268435455))} is VALID [2022-04-15 13:04:37,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {6461#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 12) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6457#(or (< (mod (+ main_~z~0 11) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:04:37,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {6465#(or (< (mod (+ main_~z~0 13) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6461#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 12) 4294967296) 268435455))} is VALID [2022-04-15 13:04:37,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {6469#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 14) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6465#(or (< (mod (+ main_~z~0 13) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:04:37,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {6473#(or (< (mod (+ main_~z~0 15) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6469#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 14) 4294967296) 268435455))} is VALID [2022-04-15 13:04:37,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {6291#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {6473#(or (< (mod (+ main_~z~0 15) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:04:37,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {6291#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6291#true} is VALID [2022-04-15 13:04:37,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {6291#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {6291#true} is VALID [2022-04-15 13:04:37,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {6291#true} call #t~ret7 := main(); {6291#true} is VALID [2022-04-15 13:04:37,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6291#true} {6291#true} #63#return; {6291#true} is VALID [2022-04-15 13:04:37,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {6291#true} assume true; {6291#true} is VALID [2022-04-15 13:04:37,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {6291#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6291#true} is VALID [2022-04-15 13:04:37,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {6291#true} call ULTIMATE.init(); {6291#true} is VALID [2022-04-15 13:04:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:37,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495111987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:37,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:37,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 21] total 39 [2022-04-15 13:04:37,612 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:37,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1422912990] [2022-04-15 13:04:37,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1422912990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:37,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:37,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 13:04:37,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816044908] [2022-04-15 13:04:37,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:37,614 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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 28 [2022-04-15 13:04:37,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:37,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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-15 13:04:37,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:37,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 13:04:37,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:37,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 13:04:37,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1111, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 13:04:37,633 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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-15 13:04:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:38,553 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-04-15 13:04:38,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 13:04:38,553 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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 28 [2022-04-15 13:04:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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-15 13:04:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-04-15 13:04:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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-15 13:04:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-04-15 13:04:38,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 61 transitions. [2022-04-15 13:04:38,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:38,614 INFO L225 Difference]: With dead ends: 69 [2022-04-15 13:04:38,614 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 13:04:38,615 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=725, Invalid=2245, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 13:04:38,615 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:38,615 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 63 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 13:04:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 13:04:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-15 13:04:38,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:38,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 38 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:38,635 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 38 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:38,635 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 38 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:38,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:38,636 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 13:04:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 13:04:38,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:38,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:38,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 39 states. [2022-04-15 13:04:38,636 INFO L87 Difference]: Start difference. First operand has 38 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 39 states. [2022-04-15 13:04:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:38,637 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 13:04:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 13:04:38,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:38,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:38,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:38,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-15 13:04:38,638 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 28 [2022-04-15 13:04:38,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:38,638 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-15 13:04:38,638 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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-15 13:04:38,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2022-04-15 13:04:38,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 13:04:38,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 13:04:38,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:38,681 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:38,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:38,885 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:38,885 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:38,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:38,886 INFO L85 PathProgramCache]: Analyzing trace with hash -615627966, now seen corresponding path program 31 times [2022-04-15 13:04:38,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:38,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [37070288] [2022-04-15 13:04:38,918 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:38,920 INFO L85 PathProgramCache]: Analyzing trace with hash 608071043, now seen corresponding path program 1 times [2022-04-15 13:04:38,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:38,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317233315] [2022-04-15 13:04:38,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:38,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:38,925 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:38,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:38,929 INFO L85 PathProgramCache]: Analyzing trace with hash -615627966, now seen corresponding path program 32 times [2022-04-15 13:04:38,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:38,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768030912] [2022-04-15 13:04:38,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:38,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:39,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:39,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {6847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6825#true} is VALID [2022-04-15 13:04:39,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {6825#true} assume true; {6825#true} is VALID [2022-04-15 13:04:39,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6825#true} {6825#true} #63#return; {6825#true} is VALID [2022-04-15 13:04:39,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {6825#true} call ULTIMATE.init(); {6847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:39,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {6847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6825#true} is VALID [2022-04-15 13:04:39,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {6825#true} assume true; {6825#true} is VALID [2022-04-15 13:04:39,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6825#true} {6825#true} #63#return; {6825#true} is VALID [2022-04-15 13:04:39,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {6825#true} call #t~ret7 := main(); {6825#true} is VALID [2022-04-15 13:04:39,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {6825#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {6825#true} is VALID [2022-04-15 13:04:39,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {6825#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6825#true} is VALID [2022-04-15 13:04:39,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {6825#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {6830#(= main_~z~0 0)} is VALID [2022-04-15 13:04:39,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {6830#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6831#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:39,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {6831#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6832#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:39,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {6832#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6833#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:39,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {6833#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6834#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:39,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {6834#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6835#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:39,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {6835#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6836#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:39,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {6836#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6837#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:39,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {6837#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6838#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:39,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {6838#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6839#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:39,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {6839#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6840#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:39,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {6840#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6841#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:39,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {6841#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6842#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:39,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {6842#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6843#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:39,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {6843#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6844#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:39,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {6844#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6845#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:04:39,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {6845#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6846#(and (<= main_~z~0 16) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:04:39,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {6846#(and (<= main_~z~0 16) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {6826#false} is VALID [2022-04-15 13:04:39,189 INFO L272 TraceCheckUtils]: 25: Hoare triple {6826#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {6826#false} is VALID [2022-04-15 13:04:39,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {6826#false} ~cond := #in~cond; {6826#false} is VALID [2022-04-15 13:04:39,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#false} assume 0 == ~cond; {6826#false} is VALID [2022-04-15 13:04:39,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#false} assume !false; {6826#false} is VALID [2022-04-15 13:04:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:39,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:39,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768030912] [2022-04-15 13:04:39,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768030912] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:39,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520646144] [2022-04-15 13:04:39,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:04:39,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:39,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:39,191 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:39,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 13:04:39,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:04:39,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:39,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 13:04:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:39,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:39,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {6825#true} call ULTIMATE.init(); {6825#true} is VALID [2022-04-15 13:04:39,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {6825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6825#true} is VALID [2022-04-15 13:04:39,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {6825#true} assume true; {6825#true} is VALID [2022-04-15 13:04:39,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6825#true} {6825#true} #63#return; {6825#true} is VALID [2022-04-15 13:04:39,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {6825#true} call #t~ret7 := main(); {6825#true} is VALID [2022-04-15 13:04:39,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {6825#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {6825#true} is VALID [2022-04-15 13:04:39,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {6825#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6825#true} is VALID [2022-04-15 13:04:39,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {6825#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {6830#(= main_~z~0 0)} is VALID [2022-04-15 13:04:39,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {6830#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6831#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:39,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {6831#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6832#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:39,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {6832#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6833#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:39,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {6833#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6834#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:39,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {6834#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6835#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:39,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {6835#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6836#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:39,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {6836#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6837#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:39,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {6837#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6838#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:39,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {6838#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6839#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:39,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {6839#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6840#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:39,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {6840#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6841#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:39,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {6841#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6842#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:39,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {6842#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6843#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:39,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {6843#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6844#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:39,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {6844#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6845#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:04:39,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {6845#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6920#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:04:39,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {6920#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 < 268435455); {6920#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:04:39,566 INFO L272 TraceCheckUtils]: 25: Hoare triple {6920#(and (<= 16 main_~z~0) (<= main_~z~0 16))} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {6927#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:04:39,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {6927#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6931#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:04:39,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {6931#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6826#false} is VALID [2022-04-15 13:04:39,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#false} assume !false; {6826#false} is VALID [2022-04-15 13:04:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:39,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:39,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#false} assume !false; {6826#false} is VALID [2022-04-15 13:04:39,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {6931#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6826#false} is VALID [2022-04-15 13:04:39,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {6927#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6931#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:04:39,756 INFO L272 TraceCheckUtils]: 25: Hoare triple {6947#(= (mod main_~z~0 4) 0)} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {6927#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:04:39,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {6947#(= (mod main_~z~0 4) 0)} assume !(~z~0 % 4294967296 < 268435455); {6947#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:04:39,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {6954#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6947#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:04:39,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {6958#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6954#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:04:39,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {6962#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6958#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:04:39,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {6947#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6962#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:04:39,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {6954#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6947#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:04:39,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {6958#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6954#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:04:39,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {6962#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6958#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:04:39,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {6947#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6962#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:04:39,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {6954#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6947#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:04:39,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {6958#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6954#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:04:39,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {6962#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6958#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:04:39,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {6947#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6962#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:04:39,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {6954#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6947#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:04:39,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {6958#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6954#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:04:39,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {6962#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6958#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:04:39,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {6947#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6962#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:04:39,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {6825#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {6947#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:04:39,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {6825#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6825#true} is VALID [2022-04-15 13:04:39,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {6825#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {6825#true} is VALID [2022-04-15 13:04:39,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {6825#true} call #t~ret7 := main(); {6825#true} is VALID [2022-04-15 13:04:39,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6825#true} {6825#true} #63#return; {6825#true} is VALID [2022-04-15 13:04:39,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {6825#true} assume true; {6825#true} is VALID [2022-04-15 13:04:39,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {6825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6825#true} is VALID [2022-04-15 13:04:39,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {6825#true} call ULTIMATE.init(); {6825#true} is VALID [2022-04-15 13:04:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 13:04:39,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520646144] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:39,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:39,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 8] total 27 [2022-04-15 13:04:39,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:39,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [37070288] [2022-04-15 13:04:39,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [37070288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:39,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:39,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 13:04:39,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342676873] [2022-04-15 13:04:39,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:39,774 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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 29 [2022-04-15 13:04:39,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:39,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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-15 13:04:39,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:39,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 13:04:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:39,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 13:04:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:04:39,794 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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-15 13:04:40,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:40,861 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2022-04-15 13:04:40,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 13:04:40,861 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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 29 [2022-04-15 13:04:40,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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-15 13:04:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 62 transitions. [2022-04-15 13:04:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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-15 13:04:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 62 transitions. [2022-04-15 13:04:40,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 62 transitions. [2022-04-15 13:04:40,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:40,911 INFO L225 Difference]: With dead ends: 71 [2022-04-15 13:04:40,911 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 13:04:40,912 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 13:04:40,912 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:40,912 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 33 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 13:04:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 13:04:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-15 13:04:40,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:40,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:40,941 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:40,941 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:40,942 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-15 13:04:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-15 13:04:40,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:40,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:40,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-15 13:04:40,942 INFO L87 Difference]: Start difference. First operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-15 13:04:40,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:40,943 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-15 13:04:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-15 13:04:40,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:40,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:40,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:40,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-15 13:04:40,945 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2022-04-15 13:04:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:40,945 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-15 13:04:40,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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-15 13:04:40,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-15 13:04:41,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:41,006 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 13:04:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 13:04:41,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:41,006 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:41,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:41,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35 [2022-04-15 13:04:41,207 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:41,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:41,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1878295198, now seen corresponding path program 33 times [2022-04-15 13:04:41,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:41,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [204419609] [2022-04-15 13:04:41,237 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:41,239 INFO L85 PathProgramCache]: Analyzing trace with hash 667176387, now seen corresponding path program 1 times [2022-04-15 13:04:41,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:41,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323566774] [2022-04-15 13:04:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:41,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:41,249 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:41,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:41,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1878295198, now seen corresponding path program 34 times [2022-04-15 13:04:41,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:41,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071951017] [2022-04-15 13:04:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:41,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:41,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {7386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7363#true} is VALID [2022-04-15 13:04:41,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {7363#true} assume true; {7363#true} is VALID [2022-04-15 13:04:41,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7363#true} {7363#true} #63#return; {7363#true} is VALID [2022-04-15 13:04:41,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {7363#true} call ULTIMATE.init(); {7386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:41,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {7386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7363#true} is VALID [2022-04-15 13:04:41,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {7363#true} assume true; {7363#true} is VALID [2022-04-15 13:04:41,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7363#true} {7363#true} #63#return; {7363#true} is VALID [2022-04-15 13:04:41,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {7363#true} call #t~ret7 := main(); {7363#true} is VALID [2022-04-15 13:04:41,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {7363#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {7363#true} is VALID [2022-04-15 13:04:41,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {7363#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {7363#true} is VALID [2022-04-15 13:04:41,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {7363#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {7368#(= main_~z~0 0)} is VALID [2022-04-15 13:04:41,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {7368#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7369#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:41,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {7369#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7370#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:41,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {7370#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7371#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:41,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {7371#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7372#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:41,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {7372#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7373#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:41,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {7373#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7374#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:41,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {7374#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7375#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:41,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {7375#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7376#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:41,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {7376#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7377#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:41,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {7377#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7378#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:41,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {7378#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7379#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:41,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {7379#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7380#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:41,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {7380#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7381#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:41,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {7381#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7382#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:41,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {7382#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7383#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:04:41,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {7383#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7384#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:04:41,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {7384#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7385#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 17))} is VALID [2022-04-15 13:04:41,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {7385#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 < 268435455); {7364#false} is VALID [2022-04-15 13:04:41,525 INFO L272 TraceCheckUtils]: 26: Hoare triple {7364#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {7364#false} is VALID [2022-04-15 13:04:41,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {7364#false} ~cond := #in~cond; {7364#false} is VALID [2022-04-15 13:04:41,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {7364#false} assume 0 == ~cond; {7364#false} is VALID [2022-04-15 13:04:41,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {7364#false} assume !false; {7364#false} is VALID [2022-04-15 13:04:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:41,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:41,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071951017] [2022-04-15 13:04:41,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071951017] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:41,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158022846] [2022-04-15 13:04:41,526 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:04:41,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:41,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:41,527 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:41,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 13:04:41,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:04:41,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:41,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 13:04:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:41,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:41,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {7363#true} call ULTIMATE.init(); {7363#true} is VALID [2022-04-15 13:04:41,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {7363#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7363#true} is VALID [2022-04-15 13:04:41,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {7363#true} assume true; {7363#true} is VALID [2022-04-15 13:04:41,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7363#true} {7363#true} #63#return; {7363#true} is VALID [2022-04-15 13:04:41,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {7363#true} call #t~ret7 := main(); {7363#true} is VALID [2022-04-15 13:04:41,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {7363#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {7363#true} is VALID [2022-04-15 13:04:41,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {7363#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {7363#true} is VALID [2022-04-15 13:04:41,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {7363#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {7368#(= main_~z~0 0)} is VALID [2022-04-15 13:04:41,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {7368#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7369#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:41,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {7369#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7370#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:41,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {7370#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7371#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:41,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {7371#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7372#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:41,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {7372#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7373#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:41,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {7373#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7374#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:41,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {7374#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7375#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:41,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {7375#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7376#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:41,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {7376#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7377#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:41,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {7377#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7378#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:41,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {7378#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7379#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:41,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {7379#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7380#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:41,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {7380#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7381#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:41,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {7381#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7382#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:41,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {7382#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7383#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:04:41,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {7383#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7384#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:04:41,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {7384#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7462#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:04:41,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {7462#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 < 268435455); {7364#false} is VALID [2022-04-15 13:04:41,862 INFO L272 TraceCheckUtils]: 26: Hoare triple {7364#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {7364#false} is VALID [2022-04-15 13:04:41,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {7364#false} ~cond := #in~cond; {7364#false} is VALID [2022-04-15 13:04:41,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {7364#false} assume 0 == ~cond; {7364#false} is VALID [2022-04-15 13:04:41,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {7364#false} assume !false; {7364#false} is VALID [2022-04-15 13:04:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:41,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:42,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {7364#false} assume !false; {7364#false} is VALID [2022-04-15 13:04:42,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {7364#false} assume 0 == ~cond; {7364#false} is VALID [2022-04-15 13:04:42,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {7364#false} ~cond := #in~cond; {7364#false} is VALID [2022-04-15 13:04:42,790 INFO L272 TraceCheckUtils]: 26: Hoare triple {7364#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {7364#false} is VALID [2022-04-15 13:04:42,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {7490#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {7364#false} is VALID [2022-04-15 13:04:42,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {7494#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7490#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {7498#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7494#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {7502#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7498#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {7506#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7502#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {7510#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7506#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {7514#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7510#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {7518#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7514#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {7522#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7518#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {7526#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7522#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {7530#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7526#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {7534#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7530#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {7538#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7534#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {7542#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7538#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {7546#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7542#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {7550#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7546#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {7554#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7550#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {7558#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7554#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {7363#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {7558#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:04:42,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {7363#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {7363#true} is VALID [2022-04-15 13:04:42,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {7363#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {7363#true} is VALID [2022-04-15 13:04:42,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {7363#true} call #t~ret7 := main(); {7363#true} is VALID [2022-04-15 13:04:42,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7363#true} {7363#true} #63#return; {7363#true} is VALID [2022-04-15 13:04:42,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {7363#true} assume true; {7363#true} is VALID [2022-04-15 13:04:42,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {7363#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7363#true} is VALID [2022-04-15 13:04:42,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {7363#true} call ULTIMATE.init(); {7363#true} is VALID [2022-04-15 13:04:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:42,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158022846] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:42,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:42,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-15 13:04:42,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:42,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [204419609] [2022-04-15 13:04:42,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [204419609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:42,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:42,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 13:04:42,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532584897] [2022-04-15 13:04:42,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:42,813 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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 30 [2022-04-15 13:04:42,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:42,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-15 13:04:42,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:42,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 13:04:42,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:42,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 13:04:42,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 13:04:42,842 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-15 13:04:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:44,222 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-04-15 13:04:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 13:04:44,222 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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 30 [2022-04-15 13:04:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-15 13:04:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 63 transitions. [2022-04-15 13:04:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-15 13:04:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 63 transitions. [2022-04-15 13:04:44,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 63 transitions. [2022-04-15 13:04:44,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:44,301 INFO L225 Difference]: With dead ends: 73 [2022-04-15 13:04:44,301 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 13:04:44,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=867, Invalid=2439, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 13:04:44,302 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:44,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 88 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 13:04:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 13:04:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-04-15 13:04:44,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:44,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 40 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:44,327 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 40 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:44,327 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 40 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:44,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:44,328 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-15 13:04:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-15 13:04:44,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:44,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:44,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 13:04:44,328 INFO L87 Difference]: Start difference. First operand has 40 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 13:04:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:44,329 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-15 13:04:44,329 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-15 13:04:44,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:44,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:44,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:44,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-15 13:04:44,330 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2022-04-15 13:04:44,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:44,330 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-15 13:04:44,331 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-15 13:04:44,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2022-04-15 13:04:44,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-15 13:04:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 13:04:44,380 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:44,380 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:44,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:44,580 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37 [2022-04-15 13:04:44,581 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:44,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1928693570, now seen corresponding path program 35 times [2022-04-15 13:04:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:44,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [719546106] [2022-04-15 13:04:44,613 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash 726281731, now seen corresponding path program 1 times [2022-04-15 13:04:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:44,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458324008] [2022-04-15 13:04:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:44,624 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:44,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:44,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1928693570, now seen corresponding path program 36 times [2022-04-15 13:04:44,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:44,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636270128] [2022-04-15 13:04:44,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:44,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:44,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:44,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {7954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7930#true} is VALID [2022-04-15 13:04:44,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {7930#true} assume true; {7930#true} is VALID [2022-04-15 13:04:44,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7930#true} {7930#true} #63#return; {7930#true} is VALID [2022-04-15 13:04:44,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {7930#true} call ULTIMATE.init(); {7954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:44,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {7954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7930#true} is VALID [2022-04-15 13:04:44,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {7930#true} assume true; {7930#true} is VALID [2022-04-15 13:04:44,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7930#true} {7930#true} #63#return; {7930#true} is VALID [2022-04-15 13:04:44,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {7930#true} call #t~ret7 := main(); {7930#true} is VALID [2022-04-15 13:04:44,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {7930#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {7930#true} is VALID [2022-04-15 13:04:44,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {7930#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {7930#true} is VALID [2022-04-15 13:04:44,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {7930#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {7935#(= main_~z~0 0)} is VALID [2022-04-15 13:04:44,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {7935#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7936#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:44,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {7936#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7937#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:44,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {7937#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7938#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:44,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {7938#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7939#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:44,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {7939#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7940#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:44,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {7940#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7941#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:44,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {7941#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7942#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:44,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {7942#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7943#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:44,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {7943#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7944#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:44,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {7944#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7945#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:44,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {7945#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7946#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:44,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {7946#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7947#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:44,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {7947#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7948#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:44,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {7948#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7949#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:44,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {7949#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7950#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:04:44,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {7950#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7951#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:04:44,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {7951#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7952#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:04:44,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {7952#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7953#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 18))} is VALID [2022-04-15 13:04:44,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {7953#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 < 268435455); {7931#false} is VALID [2022-04-15 13:04:44,950 INFO L272 TraceCheckUtils]: 27: Hoare triple {7931#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {7931#false} is VALID [2022-04-15 13:04:44,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {7931#false} ~cond := #in~cond; {7931#false} is VALID [2022-04-15 13:04:44,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {7931#false} assume 0 == ~cond; {7931#false} is VALID [2022-04-15 13:04:44,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {7931#false} assume !false; {7931#false} is VALID [2022-04-15 13:04:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:44,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:44,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636270128] [2022-04-15 13:04:44,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636270128] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:44,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575984348] [2022-04-15 13:04:44,951 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:04:44,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:44,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:44,952 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:44,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 13:04:45,117 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 13:04:45,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:45,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 13:04:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:45,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:45,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {7930#true} call ULTIMATE.init(); {7930#true} is VALID [2022-04-15 13:04:45,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {7930#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7930#true} is VALID [2022-04-15 13:04:45,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {7930#true} assume true; {7930#true} is VALID [2022-04-15 13:04:45,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7930#true} {7930#true} #63#return; {7930#true} is VALID [2022-04-15 13:04:45,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {7930#true} call #t~ret7 := main(); {7930#true} is VALID [2022-04-15 13:04:45,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {7930#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {7930#true} is VALID [2022-04-15 13:04:45,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {7930#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {7930#true} is VALID [2022-04-15 13:04:45,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {7930#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {7935#(= main_~z~0 0)} is VALID [2022-04-15 13:04:45,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {7935#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7936#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:45,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {7936#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7937#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:45,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {7937#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7938#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:45,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {7938#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7939#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:45,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {7939#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7940#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:45,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {7940#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7941#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:45,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {7941#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7942#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:45,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {7942#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7943#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:45,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {7943#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7944#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:45,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {7944#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7945#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:45,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {7945#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7946#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:45,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {7946#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7947#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:45,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {7947#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7948#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:45,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {7948#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7949#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:45,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {7949#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7950#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:04:45,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {7950#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7951#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:04:45,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {7951#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {7952#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:04:45,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {7952#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8033#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:04:45,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {8033#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 < 268435455); {7931#false} is VALID [2022-04-15 13:04:45,421 INFO L272 TraceCheckUtils]: 27: Hoare triple {7931#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {7931#false} is VALID [2022-04-15 13:04:45,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {7931#false} ~cond := #in~cond; {7931#false} is VALID [2022-04-15 13:04:45,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {7931#false} assume 0 == ~cond; {7931#false} is VALID [2022-04-15 13:04:45,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {7931#false} assume !false; {7931#false} is VALID [2022-04-15 13:04:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:45,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:46,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {7931#false} assume !false; {7931#false} is VALID [2022-04-15 13:04:46,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {7931#false} assume 0 == ~cond; {7931#false} is VALID [2022-04-15 13:04:46,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {7931#false} ~cond := #in~cond; {7931#false} is VALID [2022-04-15 13:04:46,474 INFO L272 TraceCheckUtils]: 27: Hoare triple {7931#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {7931#false} is VALID [2022-04-15 13:04:46,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {8061#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {7931#false} is VALID [2022-04-15 13:04:46,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {8065#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8061#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {8069#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8065#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {8073#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8069#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {8077#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8073#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {8081#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8077#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {8085#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8081#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {8089#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8085#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {8093#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8089#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {8097#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8093#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {8101#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8097#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {8105#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8101#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {8109#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8105#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {8113#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8109#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {8117#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8113#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {8121#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8117#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {8125#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8121#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {8129#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8125#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {8133#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8129#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {7930#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {8133#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:04:46,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {7930#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {7930#true} is VALID [2022-04-15 13:04:46,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {7930#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {7930#true} is VALID [2022-04-15 13:04:46,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {7930#true} call #t~ret7 := main(); {7930#true} is VALID [2022-04-15 13:04:46,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7930#true} {7930#true} #63#return; {7930#true} is VALID [2022-04-15 13:04:46,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {7930#true} assume true; {7930#true} is VALID [2022-04-15 13:04:46,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {7930#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7930#true} is VALID [2022-04-15 13:04:46,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {7930#true} call ULTIMATE.init(); {7930#true} is VALID [2022-04-15 13:04:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:46,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575984348] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:46,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:46,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-15 13:04:46,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:46,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [719546106] [2022-04-15 13:04:46,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [719546106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:46,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:46,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 13:04:46,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459411013] [2022-04-15 13:04:46,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:46,497 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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 31 [2022-04-15 13:04:46,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:46,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-15 13:04:46,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:46,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 13:04:46,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:46,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 13:04:46,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=1242, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 13:04:46,535 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-15 13:04:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:48,144 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-15 13:04:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 13:04:48,144 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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 31 [2022-04-15 13:04:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:48,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-15 13:04:48,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 64 transitions. [2022-04-15 13:04:48,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-15 13:04:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 64 transitions. [2022-04-15 13:04:48,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 64 transitions. [2022-04-15 13:04:48,205 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-15 13:04:48,206 INFO L225 Difference]: With dead ends: 75 [2022-04-15 13:04:48,206 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 13:04:48,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=953, Invalid=2707, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 13:04:48,207 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:48,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 88 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 13:04:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 13:04:48,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-15 13:04:48,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:48,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:48,237 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:48,238 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:48,238 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 13:04:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 13:04:48,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:48,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:48,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 42 states. [2022-04-15 13:04:48,239 INFO L87 Difference]: Start difference. First operand has 41 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 42 states. [2022-04-15 13:04:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:48,239 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 13:04:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 13:04:48,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:48,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:48,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:48,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-15 13:04:48,240 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 31 [2022-04-15 13:04:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:48,241 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-15 13:04:48,241 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-15 13:04:48,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2022-04-15 13:04:48,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-15 13:04:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 13:04:48,301 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:48,301 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:48,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:48,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2022-04-15 13:04:48,505 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:48,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:48,506 INFO L85 PathProgramCache]: Analyzing trace with hash -313738910, now seen corresponding path program 37 times [2022-04-15 13:04:48,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:48,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1892882128] [2022-04-15 13:04:48,536 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:48,537 INFO L85 PathProgramCache]: Analyzing trace with hash 785387075, now seen corresponding path program 1 times [2022-04-15 13:04:48,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:48,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354247472] [2022-04-15 13:04:48,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:48,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:48,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:48,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:48,554 INFO L85 PathProgramCache]: Analyzing trace with hash -313738910, now seen corresponding path program 38 times [2022-04-15 13:04:48,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:48,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621187912] [2022-04-15 13:04:48,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:48,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:48,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:48,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {8540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8515#true} is VALID [2022-04-15 13:04:48,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {8515#true} assume true; {8515#true} is VALID [2022-04-15 13:04:48,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8515#true} {8515#true} #63#return; {8515#true} is VALID [2022-04-15 13:04:48,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {8515#true} call ULTIMATE.init(); {8540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:48,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {8540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8515#true} is VALID [2022-04-15 13:04:48,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {8515#true} assume true; {8515#true} is VALID [2022-04-15 13:04:48,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8515#true} {8515#true} #63#return; {8515#true} is VALID [2022-04-15 13:04:48,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {8515#true} call #t~ret7 := main(); {8515#true} is VALID [2022-04-15 13:04:48,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {8515#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {8515#true} is VALID [2022-04-15 13:04:48,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {8515#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {8515#true} is VALID [2022-04-15 13:04:48,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {8515#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {8520#(= main_~z~0 0)} is VALID [2022-04-15 13:04:48,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {8520#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8521#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:48,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {8521#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8522#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:48,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {8522#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8523#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:48,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {8523#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8524#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:48,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {8524#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8525#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:48,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {8525#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8526#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:48,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {8526#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8527#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:48,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {8527#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:48,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {8528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8529#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:48,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {8529#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8530#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:48,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {8530#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8531#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:48,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {8531#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8532#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:48,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {8532#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8533#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:48,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {8533#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8534#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:48,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {8534#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8535#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:04:48,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {8535#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8536#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:04:48,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {8536#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8537#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:04:48,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {8537#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8538#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:04:48,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {8538#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8539#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 19))} is VALID [2022-04-15 13:04:48,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {8539#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 19))} assume !(~z~0 % 4294967296 < 268435455); {8516#false} is VALID [2022-04-15 13:04:48,889 INFO L272 TraceCheckUtils]: 28: Hoare triple {8516#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {8516#false} is VALID [2022-04-15 13:04:48,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {8516#false} ~cond := #in~cond; {8516#false} is VALID [2022-04-15 13:04:48,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {8516#false} assume 0 == ~cond; {8516#false} is VALID [2022-04-15 13:04:48,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {8516#false} assume !false; {8516#false} is VALID [2022-04-15 13:04:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:48,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621187912] [2022-04-15 13:04:48,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621187912] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:48,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632753946] [2022-04-15 13:04:48,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:04:48,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:48,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:48,891 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:48,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 13:04:48,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:04:48,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:48,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 13:04:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:48,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:49,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {8515#true} call ULTIMATE.init(); {8515#true} is VALID [2022-04-15 13:04:49,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {8515#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8515#true} is VALID [2022-04-15 13:04:49,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {8515#true} assume true; {8515#true} is VALID [2022-04-15 13:04:49,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8515#true} {8515#true} #63#return; {8515#true} is VALID [2022-04-15 13:04:49,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {8515#true} call #t~ret7 := main(); {8515#true} is VALID [2022-04-15 13:04:49,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {8515#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {8515#true} is VALID [2022-04-15 13:04:49,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {8515#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {8515#true} is VALID [2022-04-15 13:04:49,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {8515#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {8520#(= main_~z~0 0)} is VALID [2022-04-15 13:04:49,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {8520#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8521#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:49,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {8521#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8522#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:49,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {8522#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8523#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:49,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {8523#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8524#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:49,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {8524#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8525#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:49,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {8525#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8526#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:49,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {8526#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8527#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:49,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {8527#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:49,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {8528#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8529#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:49,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {8529#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8530#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:49,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {8530#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8531#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:49,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {8531#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8532#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:49,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {8532#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8533#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:49,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {8533#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8534#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:49,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {8534#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8535#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:04:49,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {8535#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8536#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:04:49,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {8536#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8537#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:04:49,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {8537#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8538#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:04:49,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {8538#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8622#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:04:49,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {8622#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !(~z~0 % 4294967296 < 268435455); {8516#false} is VALID [2022-04-15 13:04:49,305 INFO L272 TraceCheckUtils]: 28: Hoare triple {8516#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {8516#false} is VALID [2022-04-15 13:04:49,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {8516#false} ~cond := #in~cond; {8516#false} is VALID [2022-04-15 13:04:49,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {8516#false} assume 0 == ~cond; {8516#false} is VALID [2022-04-15 13:04:49,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {8516#false} assume !false; {8516#false} is VALID [2022-04-15 13:04:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:49,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:50,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {8516#false} assume !false; {8516#false} is VALID [2022-04-15 13:04:50,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {8516#false} assume 0 == ~cond; {8516#false} is VALID [2022-04-15 13:04:50,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {8516#false} ~cond := #in~cond; {8516#false} is VALID [2022-04-15 13:04:50,522 INFO L272 TraceCheckUtils]: 28: Hoare triple {8516#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {8516#false} is VALID [2022-04-15 13:04:50,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {8650#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {8516#false} is VALID [2022-04-15 13:04:50,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {8654#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8650#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {8658#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8654#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {8662#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8658#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {8666#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8662#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {8670#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8666#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {8674#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8670#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {8678#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8674#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {8682#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8678#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {8686#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8682#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {8690#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8686#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {8694#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8690#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {8698#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8694#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {8702#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8698#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {8706#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8702#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {8710#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8706#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {8714#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8710#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {8718#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8714#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {8722#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8718#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {8726#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {8722#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {8515#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {8726#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:50,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {8515#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {8515#true} is VALID [2022-04-15 13:04:50,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {8515#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {8515#true} is VALID [2022-04-15 13:04:50,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {8515#true} call #t~ret7 := main(); {8515#true} is VALID [2022-04-15 13:04:50,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8515#true} {8515#true} #63#return; {8515#true} is VALID [2022-04-15 13:04:50,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {8515#true} assume true; {8515#true} is VALID [2022-04-15 13:04:50,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {8515#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8515#true} is VALID [2022-04-15 13:04:50,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {8515#true} call ULTIMATE.init(); {8515#true} is VALID [2022-04-15 13:04:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:50,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632753946] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:50,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:50,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-15 13:04:50,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:50,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1892882128] [2022-04-15 13:04:50,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1892882128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:50,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:50,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 13:04:50,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011558403] [2022-04-15 13:04:50,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:50,554 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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 32 [2022-04-15 13:04:50,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:50,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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-15 13:04:50,586 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-15 13:04:50,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 13:04:50,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:50,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 13:04:50,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=1367, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 13:04:50,588 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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-15 13:04:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:52,164 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-04-15 13:04:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 13:04:52,164 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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 32 [2022-04-15 13:04:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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-15 13:04:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 65 transitions. [2022-04-15 13:04:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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-15 13:04:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 65 transitions. [2022-04-15 13:04:52,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 65 transitions. [2022-04-15 13:04:52,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:52,230 INFO L225 Difference]: With dead ends: 77 [2022-04-15 13:04:52,230 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 13:04:52,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1043, Invalid=2989, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 13:04:52,232 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:52,232 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 83 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 13:04:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 13:04:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-04-15 13:04:52,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:52,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 42 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:52,257 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 42 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:52,257 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 42 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:52,257 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-15 13:04:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-15 13:04:52,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:52,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:52,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 43 states. [2022-04-15 13:04:52,258 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 43 states. [2022-04-15 13:04:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:52,258 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-15 13:04:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-15 13:04:52,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:52,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:52,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:52,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-15 13:04:52,259 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 32 [2022-04-15 13:04:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:52,260 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-15 13:04:52,260 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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-15 13:04:52,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2022-04-15 13:04:52,317 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-15 13:04:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 13:04:52,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 13:04:52,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:52,318 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:52,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:52,518 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:52,518 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:52,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:52,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1109669054, now seen corresponding path program 39 times [2022-04-15 13:04:52,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:52,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [454471897] [2022-04-15 13:04:52,554 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:52,555 INFO L85 PathProgramCache]: Analyzing trace with hash 844492419, now seen corresponding path program 1 times [2022-04-15 13:04:52,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:52,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129189023] [2022-04-15 13:04:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:52,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:52,574 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:52,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1109669054, now seen corresponding path program 40 times [2022-04-15 13:04:52,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:52,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438757662] [2022-04-15 13:04:52,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:52,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:52,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:52,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {9144#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9118#true} is VALID [2022-04-15 13:04:52,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {9118#true} assume true; {9118#true} is VALID [2022-04-15 13:04:52,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9118#true} {9118#true} #63#return; {9118#true} is VALID [2022-04-15 13:04:52,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {9118#true} call ULTIMATE.init(); {9144#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:52,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {9144#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9118#true} is VALID [2022-04-15 13:04:52,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {9118#true} assume true; {9118#true} is VALID [2022-04-15 13:04:52,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9118#true} {9118#true} #63#return; {9118#true} is VALID [2022-04-15 13:04:52,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {9118#true} call #t~ret7 := main(); {9118#true} is VALID [2022-04-15 13:04:52,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {9118#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {9118#true} is VALID [2022-04-15 13:04:52,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {9118#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {9118#true} is VALID [2022-04-15 13:04:52,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {9118#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {9123#(= main_~z~0 0)} is VALID [2022-04-15 13:04:52,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {9123#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9124#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:52,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {9124#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9125#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:52,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {9125#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9126#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:52,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {9126#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9127#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:52,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {9127#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9128#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:52,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {9128#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9129#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:52,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {9129#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9130#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:52,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {9130#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9131#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:52,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {9131#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9132#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:52,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {9132#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9133#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:52,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {9133#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9134#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:52,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {9134#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9135#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:52,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {9135#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9136#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:52,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {9136#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9137#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:52,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {9137#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9138#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:04:52,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {9138#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9139#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:04:52,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {9139#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9140#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:04:52,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {9140#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9141#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:04:52,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {9141#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9142#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:04:52,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {9142#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9143#(and (<= main_~z~0 20) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:04:52,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {9143#(and (<= main_~z~0 20) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {9119#false} is VALID [2022-04-15 13:04:52,922 INFO L272 TraceCheckUtils]: 29: Hoare triple {9119#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {9119#false} is VALID [2022-04-15 13:04:52,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {9119#false} ~cond := #in~cond; {9119#false} is VALID [2022-04-15 13:04:52,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {9119#false} assume 0 == ~cond; {9119#false} is VALID [2022-04-15 13:04:52,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {9119#false} assume !false; {9119#false} is VALID [2022-04-15 13:04:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:52,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:52,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438757662] [2022-04-15 13:04:52,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438757662] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:52,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579877416] [2022-04-15 13:04:52,923 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:04:52,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:52,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:52,924 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:52,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 13:04:52,971 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:04:52,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:52,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 13:04:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:52,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:53,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {9118#true} call ULTIMATE.init(); {9118#true} is VALID [2022-04-15 13:04:53,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {9118#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9118#true} is VALID [2022-04-15 13:04:53,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {9118#true} assume true; {9118#true} is VALID [2022-04-15 13:04:53,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9118#true} {9118#true} #63#return; {9118#true} is VALID [2022-04-15 13:04:53,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {9118#true} call #t~ret7 := main(); {9118#true} is VALID [2022-04-15 13:04:53,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {9118#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {9118#true} is VALID [2022-04-15 13:04:53,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {9118#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {9118#true} is VALID [2022-04-15 13:04:53,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {9118#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {9123#(= main_~z~0 0)} is VALID [2022-04-15 13:04:53,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {9123#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9124#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:53,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {9124#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9125#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:53,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {9125#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9126#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:53,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {9126#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9127#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:53,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {9127#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9128#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:53,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {9128#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9129#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:53,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {9129#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9130#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:53,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {9130#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9131#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:53,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {9131#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9132#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:53,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {9132#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9133#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:53,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {9133#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9134#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:53,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {9134#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9135#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:53,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {9135#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9136#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:53,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {9136#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9137#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:53,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {9137#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9138#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:04:53,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {9138#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9139#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:04:53,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {9139#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9140#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:04:53,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {9140#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9141#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:04:53,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {9141#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9142#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:04:53,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {9142#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9229#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:04:53,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {9229#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {9119#false} is VALID [2022-04-15 13:04:53,315 INFO L272 TraceCheckUtils]: 29: Hoare triple {9119#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {9119#false} is VALID [2022-04-15 13:04:53,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {9119#false} ~cond := #in~cond; {9119#false} is VALID [2022-04-15 13:04:53,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {9119#false} assume 0 == ~cond; {9119#false} is VALID [2022-04-15 13:04:53,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {9119#false} assume !false; {9119#false} is VALID [2022-04-15 13:04:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:53,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:54,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {9119#false} assume !false; {9119#false} is VALID [2022-04-15 13:04:54,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {9119#false} assume 0 == ~cond; {9119#false} is VALID [2022-04-15 13:04:54,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {9119#false} ~cond := #in~cond; {9119#false} is VALID [2022-04-15 13:04:54,780 INFO L272 TraceCheckUtils]: 29: Hoare triple {9119#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {9119#false} is VALID [2022-04-15 13:04:54,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {9257#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {9119#false} is VALID [2022-04-15 13:04:54,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {9261#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9257#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {9265#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9261#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {9269#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9265#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {9273#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9269#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {9277#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9273#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {9281#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9277#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {9285#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9281#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {9289#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9285#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {9293#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9289#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {9297#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9293#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {9301#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9297#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {9305#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9301#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {9309#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9305#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {9313#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9309#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {9317#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9313#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {9321#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9317#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {9325#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9321#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {9329#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9325#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {9333#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9329#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {9337#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9333#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {9118#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {9337#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:04:54,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {9118#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {9118#true} is VALID [2022-04-15 13:04:54,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {9118#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {9118#true} is VALID [2022-04-15 13:04:54,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {9118#true} call #t~ret7 := main(); {9118#true} is VALID [2022-04-15 13:04:54,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9118#true} {9118#true} #63#return; {9118#true} is VALID [2022-04-15 13:04:54,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {9118#true} assume true; {9118#true} is VALID [2022-04-15 13:04:54,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {9118#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9118#true} is VALID [2022-04-15 13:04:54,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {9118#true} call ULTIMATE.init(); {9118#true} is VALID [2022-04-15 13:04:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:54,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579877416] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:54,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:54,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-15 13:04:54,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:54,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [454471897] [2022-04-15 13:04:54,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [454471897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:54,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:54,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 13:04:54,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637291761] [2022-04-15 13:04:54,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:54,808 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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 33 [2022-04-15 13:04:54,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:54,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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-15 13:04:54,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:54,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 13:04:54,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 13:04:54,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1498, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 13:04:54,833 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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-15 13:04:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:56,525 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-15 13:04:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 13:04:56,525 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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 33 [2022-04-15 13:04:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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-15 13:04:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 66 transitions. [2022-04-15 13:04:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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-15 13:04:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 66 transitions. [2022-04-15 13:04:56,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 66 transitions. [2022-04-15 13:04:56,587 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-15 13:04:56,588 INFO L225 Difference]: With dead ends: 79 [2022-04-15 13:04:56,588 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 13:04:56,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1137, Invalid=3285, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 13:04:56,589 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:56,589 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 43 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 13:04:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 13:04:56,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-15 13:04:56,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:56,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:56,615 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:56,615 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:56,616 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-15 13:04:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-15 13:04:56,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:56,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:56,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 44 states. [2022-04-15 13:04:56,616 INFO L87 Difference]: Start difference. First operand has 43 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 44 states. [2022-04-15 13:04:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:56,617 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-15 13:04:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-15 13:04:56,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:56,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:56,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:56,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:04:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-15 13:04:56,618 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 33 [2022-04-15 13:04:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:56,618 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-15 13:04:56,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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-15 13:04:56,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-15 13:04:56,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:56,690 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-15 13:04:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 13:04:56,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:56,690 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:56,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-15 13:04:56,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43 [2022-04-15 13:04:56,890 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:56,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:56,891 INFO L85 PathProgramCache]: Analyzing trace with hash -13699742, now seen corresponding path program 41 times [2022-04-15 13:04:56,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:56,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1369911092] [2022-04-15 13:04:56,920 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:04:56,921 INFO L85 PathProgramCache]: Analyzing trace with hash 903597763, now seen corresponding path program 1 times [2022-04-15 13:04:56,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:56,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26080256] [2022-04-15 13:04:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:56,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:56,927 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:04:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:04:56,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:04:56,930 INFO L85 PathProgramCache]: Analyzing trace with hash -13699742, now seen corresponding path program 42 times [2022-04-15 13:04:56,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:56,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872527138] [2022-04-15 13:04:56,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:56,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:57,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:57,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {9766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9739#true} is VALID [2022-04-15 13:04:57,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {9739#true} assume true; {9739#true} is VALID [2022-04-15 13:04:57,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9739#true} {9739#true} #63#return; {9739#true} is VALID [2022-04-15 13:04:57,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {9739#true} call ULTIMATE.init(); {9766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:57,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {9766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9739#true} is VALID [2022-04-15 13:04:57,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {9739#true} assume true; {9739#true} is VALID [2022-04-15 13:04:57,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9739#true} {9739#true} #63#return; {9739#true} is VALID [2022-04-15 13:04:57,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {9739#true} call #t~ret7 := main(); {9739#true} is VALID [2022-04-15 13:04:57,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {9739#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {9739#true} is VALID [2022-04-15 13:04:57,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {9739#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {9739#true} is VALID [2022-04-15 13:04:57,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {9739#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {9744#(= main_~z~0 0)} is VALID [2022-04-15 13:04:57,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {9744#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9745#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:57,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {9745#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9746#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:57,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {9746#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9747#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:57,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {9747#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9748#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:57,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {9748#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9749#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:57,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {9749#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9750#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:57,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {9750#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9751#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:57,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {9751#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9752#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:57,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {9752#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9753#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:57,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {9753#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9754#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:57,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {9754#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9755#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:57,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {9755#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9756#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:57,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {9756#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9757#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:57,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {9757#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9758#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:57,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {9758#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9759#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:04:57,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {9759#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9760#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:04:57,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {9760#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9761#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:04:57,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {9761#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9762#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:04:57,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {9762#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9763#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:04:57,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {9763#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9764#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:04:57,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {9764#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9765#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 21))} is VALID [2022-04-15 13:04:57,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {9765#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 21))} assume !(~z~0 % 4294967296 < 268435455); {9740#false} is VALID [2022-04-15 13:04:57,321 INFO L272 TraceCheckUtils]: 30: Hoare triple {9740#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {9740#false} is VALID [2022-04-15 13:04:57,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {9740#false} ~cond := #in~cond; {9740#false} is VALID [2022-04-15 13:04:57,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {9740#false} assume 0 == ~cond; {9740#false} is VALID [2022-04-15 13:04:57,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {9740#false} assume !false; {9740#false} is VALID [2022-04-15 13:04:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:57,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:57,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872527138] [2022-04-15 13:04:57,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872527138] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:57,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410838877] [2022-04-15 13:04:57,322 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:04:57,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:57,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:57,323 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:57,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 13:04:57,471 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-15 13:04:57,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:04:57,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 13:04:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:57,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:57,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {9739#true} call ULTIMATE.init(); {9739#true} is VALID [2022-04-15 13:04:57,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {9739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9739#true} is VALID [2022-04-15 13:04:57,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {9739#true} assume true; {9739#true} is VALID [2022-04-15 13:04:57,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9739#true} {9739#true} #63#return; {9739#true} is VALID [2022-04-15 13:04:57,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {9739#true} call #t~ret7 := main(); {9739#true} is VALID [2022-04-15 13:04:57,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {9739#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {9739#true} is VALID [2022-04-15 13:04:57,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {9739#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {9739#true} is VALID [2022-04-15 13:04:57,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {9739#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {9744#(= main_~z~0 0)} is VALID [2022-04-15 13:04:57,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {9744#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9745#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:04:57,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {9745#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9746#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:04:57,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {9746#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9747#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:04:57,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {9747#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9748#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:04:57,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {9748#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9749#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:04:57,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {9749#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9750#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:04:57,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {9750#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9751#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:04:57,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {9751#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9752#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:04:57,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {9752#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9753#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:04:57,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {9753#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9754#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:04:57,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {9754#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9755#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:04:57,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {9755#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9756#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:04:57,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {9756#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9757#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:04:57,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {9757#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9758#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:04:57,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {9758#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9759#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:04:57,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {9759#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9760#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:04:57,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {9760#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9761#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:04:57,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {9761#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9762#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:04:57,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {9762#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9763#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:04:57,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {9763#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9764#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:04:57,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {9764#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9854#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:04:57,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {9854#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {9740#false} is VALID [2022-04-15 13:04:57,818 INFO L272 TraceCheckUtils]: 30: Hoare triple {9740#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {9740#false} is VALID [2022-04-15 13:04:57,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {9740#false} ~cond := #in~cond; {9740#false} is VALID [2022-04-15 13:04:57,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {9740#false} assume 0 == ~cond; {9740#false} is VALID [2022-04-15 13:04:57,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {9740#false} assume !false; {9740#false} is VALID [2022-04-15 13:04:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:57,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:59,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {9740#false} assume !false; {9740#false} is VALID [2022-04-15 13:04:59,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {9740#false} assume 0 == ~cond; {9740#false} is VALID [2022-04-15 13:04:59,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {9740#false} ~cond := #in~cond; {9740#false} is VALID [2022-04-15 13:04:59,606 INFO L272 TraceCheckUtils]: 30: Hoare triple {9740#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {9740#false} is VALID [2022-04-15 13:04:59,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {9882#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {9740#false} is VALID [2022-04-15 13:04:59,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {9886#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9882#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {9890#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9886#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {9894#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9890#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {9898#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9894#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {9902#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9898#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {9906#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9902#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {9910#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9906#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {9914#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9910#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {9918#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9914#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {9922#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9918#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {9926#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9922#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {9930#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9926#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {9934#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9930#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {9938#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9934#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {9942#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9938#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {9946#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9942#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {9950#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9946#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {9954#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9950#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {9958#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9954#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {9962#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9958#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {9966#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {9962#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {9739#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {9966#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:04:59,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {9739#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {9739#true} is VALID [2022-04-15 13:04:59,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {9739#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {9739#true} is VALID [2022-04-15 13:04:59,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {9739#true} call #t~ret7 := main(); {9739#true} is VALID [2022-04-15 13:04:59,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9739#true} {9739#true} #63#return; {9739#true} is VALID [2022-04-15 13:04:59,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {9739#true} assume true; {9739#true} is VALID [2022-04-15 13:04:59,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {9739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9739#true} is VALID [2022-04-15 13:04:59,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {9739#true} call ULTIMATE.init(); {9739#true} is VALID [2022-04-15 13:04:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:59,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410838877] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:59,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:59,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-15 13:04:59,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:59,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1369911092] [2022-04-15 13:04:59,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1369911092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:59,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:59,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 13:04:59,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644599043] [2022-04-15 13:04:59,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:59,643 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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 34 [2022-04-15 13:04:59,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:59,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-15 13:04:59,669 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-15 13:04:59,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 13:04:59,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:59,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 13:04:59,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=1635, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 13:04:59,670 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-15 13:05:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:01,665 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-04-15 13:05:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 13:05:01,665 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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 34 [2022-04-15 13:05:01,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-15 13:05:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-15 13:05:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-15 13:05:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-15 13:05:01,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 67 transitions. [2022-04-15 13:05:01,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:01,743 INFO L225 Difference]: With dead ends: 81 [2022-04-15 13:05:01,743 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 13:05:01,744 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1235, Invalid=3595, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 13:05:01,744 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:01,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 78 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 13:05:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 13:05:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-04-15 13:05:01,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:01,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:01,774 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:01,774 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:01,774 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 13:05:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 13:05:01,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:01,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:01,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-15 13:05:01,775 INFO L87 Difference]: Start difference. First operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-15 13:05:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:01,775 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 13:05:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 13:05:01,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:01,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:01,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:01,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-15 13:05:01,777 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2022-04-15 13:05:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:01,777 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-15 13:05:01,777 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-15 13:05:01,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2022-04-15 13:05:01,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-15 13:05:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 13:05:01,846 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:01,847 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:01,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 13:05:02,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45 [2022-04-15 13:05:02,047 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:02,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:02,048 INFO L85 PathProgramCache]: Analyzing trace with hash -398389438, now seen corresponding path program 43 times [2022-04-15 13:05:02,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:02,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1962392946] [2022-04-15 13:05:02,080 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:02,081 INFO L85 PathProgramCache]: Analyzing trace with hash 962703107, now seen corresponding path program 1 times [2022-04-15 13:05:02,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:02,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228939643] [2022-04-15 13:05:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:05:02,086 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:05:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:05:02,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:05:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash -398389438, now seen corresponding path program 44 times [2022-04-15 13:05:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:02,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94193535] [2022-04-15 13:05:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:02,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:02,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:02,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {10406#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10378#true} is VALID [2022-04-15 13:05:02,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {10378#true} assume true; {10378#true} is VALID [2022-04-15 13:05:02,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10378#true} {10378#true} #63#return; {10378#true} is VALID [2022-04-15 13:05:02,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {10378#true} call ULTIMATE.init(); {10406#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:02,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {10406#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10378#true} is VALID [2022-04-15 13:05:02,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {10378#true} assume true; {10378#true} is VALID [2022-04-15 13:05:02,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10378#true} {10378#true} #63#return; {10378#true} is VALID [2022-04-15 13:05:02,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {10378#true} call #t~ret7 := main(); {10378#true} is VALID [2022-04-15 13:05:02,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {10378#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {10378#true} is VALID [2022-04-15 13:05:02,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {10378#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {10378#true} is VALID [2022-04-15 13:05:02,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {10378#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {10383#(= main_~z~0 0)} is VALID [2022-04-15 13:05:02,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {10383#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10384#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:05:02,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {10384#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10385#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:05:02,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {10385#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10386#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:05:02,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {10386#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10387#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:05:02,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {10387#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10388#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:05:02,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {10388#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10389#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:05:02,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {10389#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10390#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:05:02,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {10390#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10391#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:05:02,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {10391#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10392#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:05:02,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {10392#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10393#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:05:02,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {10393#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10394#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:05:02,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {10394#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10395#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:05:02,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {10395#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10396#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:05:02,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {10396#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10397#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:05:02,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {10397#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10398#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:05:02,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {10398#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10399#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:05:02,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {10399#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10400#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:05:02,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {10400#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10401#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:05:02,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {10401#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10402#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:05:02,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {10402#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10403#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:05:02,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {10403#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10404#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:05:02,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {10404#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10405#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 22))} is VALID [2022-04-15 13:05:02,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {10405#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 < 268435455); {10379#false} is VALID [2022-04-15 13:05:02,523 INFO L272 TraceCheckUtils]: 31: Hoare triple {10379#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {10379#false} is VALID [2022-04-15 13:05:02,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {10379#false} ~cond := #in~cond; {10379#false} is VALID [2022-04-15 13:05:02,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {10379#false} assume 0 == ~cond; {10379#false} is VALID [2022-04-15 13:05:02,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {10379#false} assume !false; {10379#false} is VALID [2022-04-15 13:05:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:02,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:02,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94193535] [2022-04-15 13:05:02,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94193535] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:05:02,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349249843] [2022-04-15 13:05:02,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:05:02,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:02,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:02,525 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:05:02,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 13:05:02,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:05:02,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:05:02,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 13:05:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:02,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:05:02,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {10378#true} call ULTIMATE.init(); {10378#true} is VALID [2022-04-15 13:05:02,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {10378#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10378#true} is VALID [2022-04-15 13:05:02,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {10378#true} assume true; {10378#true} is VALID [2022-04-15 13:05:02,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10378#true} {10378#true} #63#return; {10378#true} is VALID [2022-04-15 13:05:02,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {10378#true} call #t~ret7 := main(); {10378#true} is VALID [2022-04-15 13:05:02,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {10378#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {10378#true} is VALID [2022-04-15 13:05:02,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {10378#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {10378#true} is VALID [2022-04-15 13:05:02,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {10378#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {10383#(= main_~z~0 0)} is VALID [2022-04-15 13:05:02,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {10383#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10384#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:05:02,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {10384#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10385#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:05:02,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {10385#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10386#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:05:02,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {10386#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10387#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:05:02,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {10387#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10388#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:05:02,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {10388#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10389#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:05:02,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {10389#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10390#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:05:02,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {10390#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10391#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:05:02,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {10391#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10392#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:05:02,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {10392#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10393#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:05:02,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {10393#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10394#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:05:02,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {10394#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10395#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:05:02,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {10395#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10396#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:05:02,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {10396#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10397#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:05:02,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {10397#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10398#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:05:02,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {10398#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10399#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:05:02,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {10399#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10400#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:05:02,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {10400#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10401#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:05:02,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {10401#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10402#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:05:02,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {10402#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10403#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:05:02,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {10403#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10404#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:05:02,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {10404#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10497#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:05:02,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {10497#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 < 268435455); {10379#false} is VALID [2022-04-15 13:05:02,951 INFO L272 TraceCheckUtils]: 31: Hoare triple {10379#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {10379#false} is VALID [2022-04-15 13:05:02,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {10379#false} ~cond := #in~cond; {10379#false} is VALID [2022-04-15 13:05:02,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {10379#false} assume 0 == ~cond; {10379#false} is VALID [2022-04-15 13:05:02,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {10379#false} assume !false; {10379#false} is VALID [2022-04-15 13:05:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:02,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:05:05,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {10379#false} assume !false; {10379#false} is VALID [2022-04-15 13:05:05,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {10379#false} assume 0 == ~cond; {10379#false} is VALID [2022-04-15 13:05:05,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {10379#false} ~cond := #in~cond; {10379#false} is VALID [2022-04-15 13:05:05,257 INFO L272 TraceCheckUtils]: 31: Hoare triple {10379#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {10379#false} is VALID [2022-04-15 13:05:05,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {10525#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {10379#false} is VALID [2022-04-15 13:05:05,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {10529#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10525#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {10533#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10529#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {10537#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10533#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {10541#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10537#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {10545#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10541#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {10549#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10545#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {10553#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10549#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {10557#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10553#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {10561#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10557#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {10565#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10561#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {10569#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10565#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {10573#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10569#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {10577#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10573#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {10581#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10577#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {10585#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10581#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {10589#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10585#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {10593#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10589#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {10597#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10593#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {10601#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10597#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {10605#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10601#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {10609#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10605#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {10613#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {10609#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {10378#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {10613#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-15 13:05:05,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {10378#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {10378#true} is VALID [2022-04-15 13:05:05,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {10378#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {10378#true} is VALID [2022-04-15 13:05:05,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {10378#true} call #t~ret7 := main(); {10378#true} is VALID [2022-04-15 13:05:05,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10378#true} {10378#true} #63#return; {10378#true} is VALID [2022-04-15 13:05:05,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {10378#true} assume true; {10378#true} is VALID [2022-04-15 13:05:05,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {10378#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10378#true} is VALID [2022-04-15 13:05:05,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {10378#true} call ULTIMATE.init(); {10378#true} is VALID [2022-04-15 13:05:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:05,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349249843] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:05:05,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:05:05,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-15 13:05:05,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:05,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1962392946] [2022-04-15 13:05:05,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1962392946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:05,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:05,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 13:05:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124722302] [2022-04-15 13:05:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:05,307 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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 35 [2022-04-15 13:05:05,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:05,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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-15 13:05:05,344 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-15 13:05:05,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 13:05:05,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:05,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 13:05:05,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 13:05:05,346 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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-15 13:05:08,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:08,508 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-04-15 13:05:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 13:05:08,508 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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 35 [2022-04-15 13:05:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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-15 13:05:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2022-04-15 13:05:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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-15 13:05:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2022-04-15 13:05:08,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 68 transitions. [2022-04-15 13:05:08,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:08,601 INFO L225 Difference]: With dead ends: 83 [2022-04-15 13:05:08,601 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 13:05:08,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1337, Invalid=3919, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 13:05:08,603 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:08,603 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 58 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 13:05:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 13:05:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-15 13:05:08,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:08,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:08,639 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:08,639 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:08,640 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-15 13:05:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-15 13:05:08,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:08,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:08,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 46 states. [2022-04-15 13:05:08,640 INFO L87 Difference]: Start difference. First operand has 45 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 46 states. [2022-04-15 13:05:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:08,641 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-15 13:05:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-15 13:05:08,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:08,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:08,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:08,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-04-15 13:05:08,642 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 35 [2022-04-15 13:05:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:08,642 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-04-15 13:05:08,642 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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-15 13:05:08,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 49 transitions. [2022-04-15 13:05:08,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 13:05:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 13:05:08,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:08,730 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:08,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 13:05:08,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-15 13:05:08,931 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:08,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:08,931 INFO L85 PathProgramCache]: Analyzing trace with hash 561131874, now seen corresponding path program 45 times [2022-04-15 13:05:08,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:08,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [967443429] [2022-04-15 13:05:08,960 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:08,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1021808451, now seen corresponding path program 1 times [2022-04-15 13:05:08,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:08,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745274425] [2022-04-15 13:05:08,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:08,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:05:08,967 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:05:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:05:08,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:05:08,970 INFO L85 PathProgramCache]: Analyzing trace with hash 561131874, now seen corresponding path program 46 times [2022-04-15 13:05:08,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:08,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573238386] [2022-04-15 13:05:08,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:08,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:09,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:09,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {11064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11035#true} is VALID [2022-04-15 13:05:09,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {11035#true} assume true; {11035#true} is VALID [2022-04-15 13:05:09,388 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11035#true} {11035#true} #63#return; {11035#true} is VALID [2022-04-15 13:05:09,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {11035#true} call ULTIMATE.init(); {11064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:09,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {11064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11035#true} is VALID [2022-04-15 13:05:09,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {11035#true} assume true; {11035#true} is VALID [2022-04-15 13:05:09,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11035#true} {11035#true} #63#return; {11035#true} is VALID [2022-04-15 13:05:09,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {11035#true} call #t~ret7 := main(); {11035#true} is VALID [2022-04-15 13:05:09,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {11035#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {11035#true} is VALID [2022-04-15 13:05:09,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {11035#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {11035#true} is VALID [2022-04-15 13:05:09,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {11035#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {11040#(= main_~z~0 0)} is VALID [2022-04-15 13:05:09,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {11040#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11041#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:05:09,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {11041#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11042#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:05:09,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {11042#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11043#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:05:09,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {11043#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11044#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:05:09,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {11044#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11045#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:05:09,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {11045#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11046#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:05:09,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {11046#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11047#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:05:09,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {11047#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11048#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:05:09,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {11048#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11049#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:05:09,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {11049#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11050#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:05:09,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {11050#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11051#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:05:09,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {11051#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11052#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:05:09,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {11052#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11053#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:05:09,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {11053#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11054#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:05:09,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {11054#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11055#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:05:09,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {11055#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11056#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:05:09,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {11056#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11057#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:05:09,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {11057#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11058#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:05:09,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {11058#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11059#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:05:09,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {11059#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11060#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:05:09,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {11060#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11061#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:05:09,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {11061#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11062#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:05:09,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {11062#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11063#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 23))} is VALID [2022-04-15 13:05:09,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {11063#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 23))} assume !(~z~0 % 4294967296 < 268435455); {11036#false} is VALID [2022-04-15 13:05:09,432 INFO L272 TraceCheckUtils]: 32: Hoare triple {11036#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {11036#false} is VALID [2022-04-15 13:05:09,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {11036#false} ~cond := #in~cond; {11036#false} is VALID [2022-04-15 13:05:09,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {11036#false} assume 0 == ~cond; {11036#false} is VALID [2022-04-15 13:05:09,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {11036#false} assume !false; {11036#false} is VALID [2022-04-15 13:05:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:09,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573238386] [2022-04-15 13:05:09,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573238386] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:05:09,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787080468] [2022-04-15 13:05:09,432 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:05:09,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:09,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:09,433 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:05:09,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 13:05:09,492 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:05:09,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:05:09,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-15 13:05:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:09,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:05:09,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {11035#true} call ULTIMATE.init(); {11035#true} is VALID [2022-04-15 13:05:09,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {11035#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11035#true} is VALID [2022-04-15 13:05:09,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {11035#true} assume true; {11035#true} is VALID [2022-04-15 13:05:09,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11035#true} {11035#true} #63#return; {11035#true} is VALID [2022-04-15 13:05:09,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {11035#true} call #t~ret7 := main(); {11035#true} is VALID [2022-04-15 13:05:09,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {11035#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {11035#true} is VALID [2022-04-15 13:05:09,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {11035#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {11035#true} is VALID [2022-04-15 13:05:09,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {11035#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {11040#(= main_~z~0 0)} is VALID [2022-04-15 13:05:09,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {11040#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11041#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:05:09,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {11041#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11042#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:05:09,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {11042#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11043#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:05:09,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {11043#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11044#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:05:09,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {11044#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11045#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:05:09,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {11045#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11046#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:05:09,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {11046#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11047#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:05:09,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {11047#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11048#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:05:09,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {11048#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11049#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:05:09,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {11049#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11050#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:05:09,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {11050#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11051#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:05:09,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {11051#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11052#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:05:09,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {11052#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11053#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:05:09,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {11053#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11054#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:05:09,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {11054#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11055#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:05:09,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {11055#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11056#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:05:09,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {11056#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11057#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:05:09,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {11057#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11058#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:05:09,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {11058#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11059#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:05:09,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {11059#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11060#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:05:09,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {11060#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11061#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:05:09,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {11061#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11062#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:05:09,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {11062#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11158#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:05:09,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {11158#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !(~z~0 % 4294967296 < 268435455); {11036#false} is VALID [2022-04-15 13:05:09,866 INFO L272 TraceCheckUtils]: 32: Hoare triple {11036#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {11036#false} is VALID [2022-04-15 13:05:09,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {11036#false} ~cond := #in~cond; {11036#false} is VALID [2022-04-15 13:05:09,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {11036#false} assume 0 == ~cond; {11036#false} is VALID [2022-04-15 13:05:09,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {11036#false} assume !false; {11036#false} is VALID [2022-04-15 13:05:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:09,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:05:12,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {11036#false} assume !false; {11036#false} is VALID [2022-04-15 13:05:12,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {11036#false} assume 0 == ~cond; {11036#false} is VALID [2022-04-15 13:05:12,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {11036#false} ~cond := #in~cond; {11036#false} is VALID [2022-04-15 13:05:12,813 INFO L272 TraceCheckUtils]: 32: Hoare triple {11036#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {11036#false} is VALID [2022-04-15 13:05:12,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {11186#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {11036#false} is VALID [2022-04-15 13:05:12,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {11190#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11186#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {11194#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11190#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {11198#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11194#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {11202#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11198#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {11206#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11202#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {11210#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11206#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {11214#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11210#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {11218#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11214#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {11222#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11218#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {11226#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11222#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {11230#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11226#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {11234#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11230#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {11238#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11234#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {11242#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11238#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {11246#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11242#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {11250#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11246#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {11254#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11250#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {11258#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11254#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {11262#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11258#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {11266#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11262#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {11270#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11266#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {11274#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11270#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {11278#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11274#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {11035#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {11278#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:12,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {11035#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {11035#true} is VALID [2022-04-15 13:05:12,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {11035#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {11035#true} is VALID [2022-04-15 13:05:12,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {11035#true} call #t~ret7 := main(); {11035#true} is VALID [2022-04-15 13:05:12,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11035#true} {11035#true} #63#return; {11035#true} is VALID [2022-04-15 13:05:12,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {11035#true} assume true; {11035#true} is VALID [2022-04-15 13:05:12,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {11035#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11035#true} is VALID [2022-04-15 13:05:12,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {11035#true} call ULTIMATE.init(); {11035#true} is VALID [2022-04-15 13:05:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:12,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787080468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:05:12,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:05:12,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-15 13:05:12,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:12,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [967443429] [2022-04-15 13:05:12,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [967443429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:12,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:12,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 13:05:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527216444] [2022-04-15 13:05:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:12,894 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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 36 [2022-04-15 13:05:12,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:12,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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-15 13:05:12,939 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-15 13:05:12,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 13:05:12,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:12,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 13:05:12,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 13:05:12,940 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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-15 13:05:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:17,566 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-04-15 13:05:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 13:05:17,566 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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 36 [2022-04-15 13:05:17,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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-15 13:05:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 69 transitions. [2022-04-15 13:05:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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-15 13:05:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 69 transitions. [2022-04-15 13:05:17,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 69 transitions. [2022-04-15 13:05:17,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:17,680 INFO L225 Difference]: With dead ends: 85 [2022-04-15 13:05:17,680 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 13:05:17,681 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1443, Invalid=4257, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 13:05:17,681 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:17,682 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 128 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 13:05:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 13:05:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-15 13:05:17,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:17,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:17,715 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:17,715 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:17,715 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-15 13:05:17,715 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-15 13:05:17,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:17,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:17,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-15 13:05:17,716 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-15 13:05:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:17,716 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-15 13:05:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-15 13:05:17,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:17,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:17,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:17,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-15 13:05:17,717 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 36 [2022-04-15 13:05:17,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:17,718 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-15 13:05:17,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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-15 13:05:17,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 50 transitions. [2022-04-15 13:05:17,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:17,841 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-15 13:05:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 13:05:17,847 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:17,847 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:17,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 13:05:18,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:18,048 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash 241521474, now seen corresponding path program 47 times [2022-04-15 13:05:18,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:18,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [521335726] [2022-04-15 13:05:18,077 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:18,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1080913795, now seen corresponding path program 1 times [2022-04-15 13:05:18,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:18,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563495048] [2022-04-15 13:05:18,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:18,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:05:18,089 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:05:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:05:18,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:05:18,093 INFO L85 PathProgramCache]: Analyzing trace with hash 241521474, now seen corresponding path program 48 times [2022-04-15 13:05:18,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:18,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777964264] [2022-04-15 13:05:18,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:18,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:18,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:18,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {11740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11710#true} is VALID [2022-04-15 13:05:18,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {11710#true} assume true; {11710#true} is VALID [2022-04-15 13:05:18,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11710#true} {11710#true} #63#return; {11710#true} is VALID [2022-04-15 13:05:18,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {11710#true} call ULTIMATE.init(); {11740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:18,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {11740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11710#true} is VALID [2022-04-15 13:05:18,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {11710#true} assume true; {11710#true} is VALID [2022-04-15 13:05:18,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11710#true} {11710#true} #63#return; {11710#true} is VALID [2022-04-15 13:05:18,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {11710#true} call #t~ret7 := main(); {11710#true} is VALID [2022-04-15 13:05:18,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {11710#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {11710#true} is VALID [2022-04-15 13:05:18,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {11710#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {11710#true} is VALID [2022-04-15 13:05:18,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {11710#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {11715#(= main_~z~0 0)} is VALID [2022-04-15 13:05:18,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {11715#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11716#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:05:18,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {11716#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11717#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:05:18,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {11717#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11718#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:05:18,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {11718#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11719#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:05:18,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {11719#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11720#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:05:18,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {11720#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11721#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:05:18,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {11721#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11722#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:05:18,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {11722#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11723#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:05:18,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {11723#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11724#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:05:18,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {11724#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11725#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:05:18,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {11725#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11726#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:05:18,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {11726#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11727#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:05:18,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {11727#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11728#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:05:18,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {11728#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11729#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:05:18,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {11729#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11730#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:05:18,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {11730#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11731#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:05:18,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {11731#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11732#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:05:18,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {11732#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11733#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:05:18,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {11733#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11734#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:05:18,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {11734#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11735#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:05:18,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {11735#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11736#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:05:18,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {11736#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11737#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:05:18,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {11737#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11738#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:05:18,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {11738#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11739#(and (<= main_~z~0 24) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:05:18,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {11739#(and (<= main_~z~0 24) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {11711#false} is VALID [2022-04-15 13:05:18,588 INFO L272 TraceCheckUtils]: 33: Hoare triple {11711#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {11711#false} is VALID [2022-04-15 13:05:18,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {11711#false} ~cond := #in~cond; {11711#false} is VALID [2022-04-15 13:05:18,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {11711#false} assume 0 == ~cond; {11711#false} is VALID [2022-04-15 13:05:18,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {11711#false} assume !false; {11711#false} is VALID [2022-04-15 13:05:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:18,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:18,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777964264] [2022-04-15 13:05:18,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777964264] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:05:18,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462828854] [2022-04-15 13:05:18,589 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:05:18,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:18,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:18,590 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:05:18,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 13:05:19,054 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 13:05:19,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:05:19,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 13:05:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:19,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:05:19,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {11710#true} call ULTIMATE.init(); {11710#true} is VALID [2022-04-15 13:05:19,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {11710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11710#true} is VALID [2022-04-15 13:05:19,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {11710#true} assume true; {11710#true} is VALID [2022-04-15 13:05:19,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11710#true} {11710#true} #63#return; {11710#true} is VALID [2022-04-15 13:05:19,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {11710#true} call #t~ret7 := main(); {11710#true} is VALID [2022-04-15 13:05:19,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {11710#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {11710#true} is VALID [2022-04-15 13:05:19,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {11710#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {11710#true} is VALID [2022-04-15 13:05:19,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {11710#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {11715#(= main_~z~0 0)} is VALID [2022-04-15 13:05:19,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {11715#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11716#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:05:19,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {11716#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11717#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:05:19,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {11717#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11718#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:05:19,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {11718#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11719#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:05:19,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {11719#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11720#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:05:19,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {11720#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11721#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:05:19,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {11721#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11722#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:05:19,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {11722#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11723#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:05:19,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {11723#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11724#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:05:19,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {11724#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11725#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:05:19,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {11725#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11726#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:05:19,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {11726#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11727#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:05:19,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {11727#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11728#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:05:19,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {11728#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11729#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:05:19,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {11729#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11730#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:05:19,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {11730#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11731#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:05:19,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {11731#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11732#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:05:19,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {11732#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11733#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:05:19,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {11733#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11734#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:05:19,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {11734#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11735#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:05:19,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {11735#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11736#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:05:19,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {11736#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11737#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:05:19,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {11737#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11738#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:05:19,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {11738#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11837#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:05:19,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {11837#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {11837#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:05:19,475 INFO L272 TraceCheckUtils]: 33: Hoare triple {11837#(and (<= main_~z~0 24) (<= 24 main_~z~0))} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {11844#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:05:19,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {11844#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11848#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:05:19,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {11848#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11711#false} is VALID [2022-04-15 13:05:19,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {11711#false} assume !false; {11711#false} is VALID [2022-04-15 13:05:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:19,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:05:19,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {11711#false} assume !false; {11711#false} is VALID [2022-04-15 13:05:19,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {11848#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11711#false} is VALID [2022-04-15 13:05:19,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {11844#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11848#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:05:19,733 INFO L272 TraceCheckUtils]: 33: Hoare triple {11864#(= (mod main_~z~0 4) 0)} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {11844#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:05:19,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {11864#(= (mod main_~z~0 4) 0)} assume !(~z~0 % 4294967296 < 268435455); {11864#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:05:19,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {11871#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11864#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:05:19,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {11875#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11871#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:05:19,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {11879#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11875#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:05:19,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {11864#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11879#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:05:19,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {11871#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11864#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:05:19,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {11875#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11871#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:05:19,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {11879#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11875#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:05:19,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {11864#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11879#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:05:19,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {11871#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11864#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:05:19,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {11875#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11871#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:05:19,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {11879#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11875#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:05:19,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {11864#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11879#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:05:19,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {11871#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11864#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:05:19,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {11875#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11871#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:05:19,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {11879#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11875#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:05:19,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {11864#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11879#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:05:19,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {11871#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11864#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:05:19,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {11875#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11871#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:05:19,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {11879#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11875#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:05:19,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {11864#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11879#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:05:19,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {11871#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11864#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:05:19,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {11875#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11871#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:05:19,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {11879#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11875#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:05:19,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {11864#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {11879#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:05:19,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {11710#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {11864#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:05:19,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {11710#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {11710#true} is VALID [2022-04-15 13:05:19,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {11710#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {11710#true} is VALID [2022-04-15 13:05:19,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {11710#true} call #t~ret7 := main(); {11710#true} is VALID [2022-04-15 13:05:19,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11710#true} {11710#true} #63#return; {11710#true} is VALID [2022-04-15 13:05:19,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {11710#true} assume true; {11710#true} is VALID [2022-04-15 13:05:19,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {11710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11710#true} is VALID [2022-04-15 13:05:19,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {11710#true} call ULTIMATE.init(); {11710#true} is VALID [2022-04-15 13:05:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-15 13:05:19,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462828854] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:05:19,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:05:19,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 8] total 35 [2022-04-15 13:05:19,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:19,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [521335726] [2022-04-15 13:05:19,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [521335726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:19,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:19,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 13:05:19,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928537925] [2022-04-15 13:05:19,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:19,777 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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 37 [2022-04-15 13:05:19,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:19,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-15 13:05:19,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:19,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 13:05:19,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:19,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 13:05:19,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 13:05:19,822 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-15 13:05:24,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:24,930 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-04-15 13:05:24,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 13:05:24,931 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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 37 [2022-04-15 13:05:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-15 13:05:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-15 13:05:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-15 13:05:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-15 13:05:24,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 70 transitions. [2022-04-15 13:05:25,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:25,044 INFO L225 Difference]: With dead ends: 87 [2022-04-15 13:05:25,044 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 13:05:25,045 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=289, Invalid=3251, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 13:05:25,045 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:25,045 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 138 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 13:05:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 13:05:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-04-15 13:05:25,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:25,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 47 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:25,085 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 47 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:25,085 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 47 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:25,086 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-15 13:05:25,086 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-15 13:05:25,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:25,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:25,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 48 states. [2022-04-15 13:05:25,086 INFO L87 Difference]: Start difference. First operand has 47 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 48 states. [2022-04-15 13:05:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:25,087 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-15 13:05:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-15 13:05:25,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:25,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:25,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:25,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-15 13:05:25,088 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 37 [2022-04-15 13:05:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:25,088 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-15 13:05:25,088 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-15 13:05:25,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-15 13:05:25,227 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-15 13:05:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-15 13:05:25,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 13:05:25,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:25,228 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:25,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 13:05:25,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:25,429 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1076466334, now seen corresponding path program 49 times [2022-04-15 13:05:25,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:25,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [669769000] [2022-04-15 13:05:25,459 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:25,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1140019139, now seen corresponding path program 1 times [2022-04-15 13:05:25,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:25,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758361587] [2022-04-15 13:05:25,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:25,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:05:25,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:05:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:05:25,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:05:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1076466334, now seen corresponding path program 50 times [2022-04-15 13:05:25,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:25,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938719410] [2022-04-15 13:05:25,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:25,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:25,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:25,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {12415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12384#true} is VALID [2022-04-15 13:05:25,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {12384#true} assume true; {12384#true} is VALID [2022-04-15 13:05:25,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12384#true} {12384#true} #63#return; {12384#true} is VALID [2022-04-15 13:05:25,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {12384#true} call ULTIMATE.init(); {12415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:25,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {12415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12384#true} is VALID [2022-04-15 13:05:25,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {12384#true} assume true; {12384#true} is VALID [2022-04-15 13:05:25,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12384#true} {12384#true} #63#return; {12384#true} is VALID [2022-04-15 13:05:25,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {12384#true} call #t~ret7 := main(); {12384#true} is VALID [2022-04-15 13:05:25,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {12384#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {12384#true} is VALID [2022-04-15 13:05:25,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {12384#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {12384#true} is VALID [2022-04-15 13:05:25,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {12384#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {12389#(= main_~z~0 0)} is VALID [2022-04-15 13:05:25,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {12389#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12390#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:05:25,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {12390#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12391#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:05:25,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {12391#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12392#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:05:25,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {12392#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12393#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:05:25,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {12393#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12394#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:05:25,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {12394#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12395#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:05:25,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {12395#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12396#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:05:25,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {12396#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12397#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:05:25,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {12397#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12398#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:05:25,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {12398#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12399#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:05:25,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {12399#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12400#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:05:25,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {12400#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12401#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:05:25,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {12401#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12402#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:05:25,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {12402#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12403#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:05:25,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {12403#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12404#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:05:25,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {12404#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12405#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:05:25,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {12405#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12406#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:05:25,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {12406#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12407#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:05:25,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {12407#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12408#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:05:25,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {12408#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12409#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:05:25,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {12409#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12410#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:05:25,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {12410#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12411#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:05:25,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {12411#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12412#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:05:25,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {12412#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12413#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:05:25,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {12413#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12414#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 25))} is VALID [2022-04-15 13:05:25,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {12414#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 25))} assume !(~z~0 % 4294967296 < 268435455); {12385#false} is VALID [2022-04-15 13:05:25,975 INFO L272 TraceCheckUtils]: 34: Hoare triple {12385#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {12385#false} is VALID [2022-04-15 13:05:25,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {12385#false} ~cond := #in~cond; {12385#false} is VALID [2022-04-15 13:05:25,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {12385#false} assume 0 == ~cond; {12385#false} is VALID [2022-04-15 13:05:25,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {12385#false} assume !false; {12385#false} is VALID [2022-04-15 13:05:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:25,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:25,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938719410] [2022-04-15 13:05:25,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938719410] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:05:25,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43540726] [2022-04-15 13:05:25,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:05:25,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:25,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:25,977 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:05:25,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 13:05:26,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:05:26,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:05:26,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 13:05:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:26,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:05:26,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {12384#true} call ULTIMATE.init(); {12384#true} is VALID [2022-04-15 13:05:26,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {12384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12384#true} is VALID [2022-04-15 13:05:26,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {12384#true} assume true; {12384#true} is VALID [2022-04-15 13:05:26,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12384#true} {12384#true} #63#return; {12384#true} is VALID [2022-04-15 13:05:26,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {12384#true} call #t~ret7 := main(); {12384#true} is VALID [2022-04-15 13:05:26,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {12384#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {12384#true} is VALID [2022-04-15 13:05:26,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {12384#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {12384#true} is VALID [2022-04-15 13:05:26,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {12384#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {12389#(= main_~z~0 0)} is VALID [2022-04-15 13:05:26,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {12389#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12390#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:05:26,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {12390#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12391#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:05:26,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {12391#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12392#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:05:26,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {12392#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12393#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:05:26,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {12393#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12394#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:05:26,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {12394#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12395#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:05:26,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {12395#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12396#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:05:26,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {12396#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12397#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:05:26,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {12397#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12398#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:05:26,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {12398#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12399#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:05:26,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {12399#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12400#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:05:26,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {12400#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12401#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:05:26,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {12401#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12402#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:05:26,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {12402#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12403#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:05:26,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {12403#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12404#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:05:26,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {12404#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12405#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:05:26,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {12405#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12406#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:05:26,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {12406#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12407#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:05:26,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {12407#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12408#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:05:26,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {12408#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12409#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:05:26,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {12409#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12410#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:05:26,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {12410#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12411#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:05:26,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {12411#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12412#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:05:26,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {12412#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12413#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:05:26,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {12413#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12515#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:05:26,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {12515#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !(~z~0 % 4294967296 < 268435455); {12385#false} is VALID [2022-04-15 13:05:26,490 INFO L272 TraceCheckUtils]: 34: Hoare triple {12385#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {12385#false} is VALID [2022-04-15 13:05:26,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {12385#false} ~cond := #in~cond; {12385#false} is VALID [2022-04-15 13:05:26,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {12385#false} assume 0 == ~cond; {12385#false} is VALID [2022-04-15 13:05:26,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {12385#false} assume !false; {12385#false} is VALID [2022-04-15 13:05:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:26,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:05:30,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {12385#false} assume !false; {12385#false} is VALID [2022-04-15 13:05:30,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {12385#false} assume 0 == ~cond; {12385#false} is VALID [2022-04-15 13:05:30,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {12385#false} ~cond := #in~cond; {12385#false} is VALID [2022-04-15 13:05:30,875 INFO L272 TraceCheckUtils]: 34: Hoare triple {12385#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {12385#false} is VALID [2022-04-15 13:05:30,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {12543#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {12385#false} is VALID [2022-04-15 13:05:30,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {12547#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12543#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {12551#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12547#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {12555#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12551#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {12559#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12555#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {12563#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12559#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {12567#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12563#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {12571#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12567#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {12575#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12571#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {12579#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12575#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {12583#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12579#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {12587#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12583#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {12591#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12587#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {12595#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12591#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {12599#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12595#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {12603#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12599#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {12607#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12603#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {12611#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12607#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {12615#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12611#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {12619#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12615#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {12623#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12619#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {12627#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12623#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {12631#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12627#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {12635#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12631#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {12639#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12635#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {12643#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {12639#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {12384#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {12643#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} is VALID [2022-04-15 13:05:30,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {12384#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {12384#true} is VALID [2022-04-15 13:05:30,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {12384#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {12384#true} is VALID [2022-04-15 13:05:30,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {12384#true} call #t~ret7 := main(); {12384#true} is VALID [2022-04-15 13:05:30,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12384#true} {12384#true} #63#return; {12384#true} is VALID [2022-04-15 13:05:30,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {12384#true} assume true; {12384#true} is VALID [2022-04-15 13:05:30,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {12384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12384#true} is VALID [2022-04-15 13:05:30,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {12384#true} call ULTIMATE.init(); {12384#true} is VALID [2022-04-15 13:05:30,969 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:30,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43540726] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:05:30,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:05:30,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-15 13:05:30,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:30,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [669769000] [2022-04-15 13:05:30,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [669769000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:30,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:30,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 13:05:30,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249823985] [2022-04-15 13:05:30,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:30,970 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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 38 [2022-04-15 13:05:30,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:30,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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-15 13:05:31,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:31,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 13:05:31,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:31,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 13:05:31,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=837, Invalid=2243, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 13:05:31,019 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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-15 13:05:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:37,391 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-15 13:05:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 13:05:37,391 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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 38 [2022-04-15 13:05:37,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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-15 13:05:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 71 transitions. [2022-04-15 13:05:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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-15 13:05:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 71 transitions. [2022-04-15 13:05:37,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 71 transitions. [2022-04-15 13:05:37,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:37,496 INFO L225 Difference]: With dead ends: 89 [2022-04-15 13:05:37,496 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 13:05:37,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1667, Invalid=4975, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 13:05:37,497 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:37,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 83 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 13:05:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 13:05:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2022-04-15 13:05:37,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:37,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 48 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:37,531 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 48 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:37,531 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 48 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:37,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:37,532 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-15 13:05:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-15 13:05:37,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:37,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:37,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 49 states. [2022-04-15 13:05:37,532 INFO L87 Difference]: Start difference. First operand has 48 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 49 states. [2022-04-15 13:05:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:37,533 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-15 13:05:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-15 13:05:37,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:37,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:37,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:37,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:37,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-04-15 13:05:37,534 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 38 [2022-04-15 13:05:37,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:37,534 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-04-15 13:05:37,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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-15 13:05:37,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 52 transitions. [2022-04-15 13:05:37,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:37,673 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-15 13:05:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 13:05:37,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:37,673 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:37,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-15 13:05:37,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53 [2022-04-15 13:05:37,876 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:37,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:37,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1015584578, now seen corresponding path program 51 times [2022-04-15 13:05:37,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:37,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [747381332] [2022-04-15 13:05:37,905 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:37,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1199124483, now seen corresponding path program 1 times [2022-04-15 13:05:37,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:37,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802873623] [2022-04-15 13:05:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:37,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:05:37,911 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:05:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:05:37,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:05:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1015584578, now seen corresponding path program 52 times [2022-04-15 13:05:37,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:37,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764073190] [2022-04-15 13:05:37,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:37,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:38,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {13127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13095#true} is VALID [2022-04-15 13:05:38,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {13095#true} assume true; {13095#true} is VALID [2022-04-15 13:05:38,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13095#true} {13095#true} #63#return; {13095#true} is VALID [2022-04-15 13:05:38,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {13095#true} call ULTIMATE.init(); {13127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:38,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {13127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13095#true} is VALID [2022-04-15 13:05:38,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {13095#true} assume true; {13095#true} is VALID [2022-04-15 13:05:38,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13095#true} {13095#true} #63#return; {13095#true} is VALID [2022-04-15 13:05:38,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {13095#true} call #t~ret7 := main(); {13095#true} is VALID [2022-04-15 13:05:38,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {13095#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {13095#true} is VALID [2022-04-15 13:05:38,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {13095#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {13095#true} is VALID [2022-04-15 13:05:38,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {13095#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {13100#(= main_~z~0 0)} is VALID [2022-04-15 13:05:38,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {13100#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13101#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:05:38,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {13101#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13102#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:05:38,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {13102#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13103#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:05:38,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {13103#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13104#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:05:38,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {13104#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13105#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:05:38,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {13105#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13106#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:05:38,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {13106#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13107#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:05:38,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {13107#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13108#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:05:38,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {13108#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13109#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:05:38,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {13109#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13110#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:05:38,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {13110#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13111#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:05:38,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {13111#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13112#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:05:38,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {13112#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13113#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:05:38,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {13113#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13114#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:05:38,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {13114#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13115#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:05:38,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {13115#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13116#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:05:38,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {13116#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13117#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:05:38,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {13117#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13118#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:05:38,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {13118#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13119#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:05:38,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {13119#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13120#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:05:38,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {13120#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13121#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:05:38,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {13121#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13122#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:05:38,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {13122#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13123#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:05:38,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {13123#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13124#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:05:38,459 INFO L290 TraceCheckUtils]: 32: Hoare triple {13124#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13125#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:05:38,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {13125#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13126#(and (<= main_~z~0 26) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:05:38,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {13126#(and (<= main_~z~0 26) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {13096#false} is VALID [2022-04-15 13:05:38,462 INFO L272 TraceCheckUtils]: 35: Hoare triple {13096#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {13096#false} is VALID [2022-04-15 13:05:38,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {13096#false} ~cond := #in~cond; {13096#false} is VALID [2022-04-15 13:05:38,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {13096#false} assume 0 == ~cond; {13096#false} is VALID [2022-04-15 13:05:38,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {13096#false} assume !false; {13096#false} is VALID [2022-04-15 13:05:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:38,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:38,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764073190] [2022-04-15 13:05:38,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764073190] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:05:38,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230230269] [2022-04-15 13:05:38,463 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:05:38,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:38,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:38,464 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:05:38,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 13:05:38,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:05:38,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:05:38,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-15 13:05:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:38,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:05:38,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {13095#true} call ULTIMATE.init(); {13095#true} is VALID [2022-04-15 13:05:38,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {13095#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13095#true} is VALID [2022-04-15 13:05:38,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {13095#true} assume true; {13095#true} is VALID [2022-04-15 13:05:38,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13095#true} {13095#true} #63#return; {13095#true} is VALID [2022-04-15 13:05:38,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {13095#true} call #t~ret7 := main(); {13095#true} is VALID [2022-04-15 13:05:38,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {13095#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {13095#true} is VALID [2022-04-15 13:05:38,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {13095#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {13095#true} is VALID [2022-04-15 13:05:38,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {13095#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {13100#(= main_~z~0 0)} is VALID [2022-04-15 13:05:38,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {13100#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13101#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:05:38,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {13101#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13102#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:05:38,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {13102#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13103#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:05:38,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {13103#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13104#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:05:38,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {13104#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13105#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:05:38,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {13105#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13106#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:05:38,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {13106#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13107#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:05:38,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {13107#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13108#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:05:38,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {13108#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13109#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:05:38,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {13109#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13110#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:05:38,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {13110#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13111#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:05:38,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {13111#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13112#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:05:38,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {13112#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13113#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:05:38,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {13113#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13114#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:05:38,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {13114#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13115#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:05:38,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {13115#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13116#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:05:38,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {13116#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13117#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:05:38,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {13117#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13118#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:05:38,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {13118#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13119#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:05:38,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {13119#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13120#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:05:38,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {13120#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13121#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:05:38,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {13121#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13122#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:05:38,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {13122#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13123#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:05:38,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {13123#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13124#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:05:38,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {13124#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13125#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:05:38,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {13125#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13230#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:05:38,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {13230#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {13096#false} is VALID [2022-04-15 13:05:38,964 INFO L272 TraceCheckUtils]: 35: Hoare triple {13096#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {13096#false} is VALID [2022-04-15 13:05:38,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {13096#false} ~cond := #in~cond; {13096#false} is VALID [2022-04-15 13:05:38,964 INFO L290 TraceCheckUtils]: 37: Hoare triple {13096#false} assume 0 == ~cond; {13096#false} is VALID [2022-04-15 13:05:38,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {13096#false} assume !false; {13096#false} is VALID [2022-04-15 13:05:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:38,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:05:44,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {13096#false} assume !false; {13096#false} is VALID [2022-04-15 13:05:44,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {13096#false} assume 0 == ~cond; {13096#false} is VALID [2022-04-15 13:05:44,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {13096#false} ~cond := #in~cond; {13096#false} is VALID [2022-04-15 13:05:44,671 INFO L272 TraceCheckUtils]: 35: Hoare triple {13096#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {13096#false} is VALID [2022-04-15 13:05:44,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {13258#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {13096#false} is VALID [2022-04-15 13:05:44,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {13262#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13258#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {13266#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13262#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {13270#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13266#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {13274#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13270#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {13278#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13274#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {13282#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13278#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {13286#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13282#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {13290#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13286#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {13294#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13290#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {13298#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13294#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {13302#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13298#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {13306#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13302#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {13310#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13306#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {13314#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13310#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {13318#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13314#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {13322#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13318#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {13326#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13322#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {13330#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13326#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {13334#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13330#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {13338#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13334#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {13342#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13338#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {13346#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13342#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {13350#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13346#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {13354#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13350#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {13358#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13354#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {13362#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13358#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {13095#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {13362#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} is VALID [2022-04-15 13:05:44,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {13095#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {13095#true} is VALID [2022-04-15 13:05:44,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {13095#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {13095#true} is VALID [2022-04-15 13:05:44,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {13095#true} call #t~ret7 := main(); {13095#true} is VALID [2022-04-15 13:05:44,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13095#true} {13095#true} #63#return; {13095#true} is VALID [2022-04-15 13:05:44,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {13095#true} assume true; {13095#true} is VALID [2022-04-15 13:05:44,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {13095#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13095#true} is VALID [2022-04-15 13:05:44,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {13095#true} call ULTIMATE.init(); {13095#true} is VALID [2022-04-15 13:05:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:44,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230230269] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:05:44,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:05:44,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-15 13:05:44,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:44,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [747381332] [2022-04-15 13:05:44,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [747381332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:44,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:44,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 13:05:44,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518658760] [2022-04-15 13:05:44,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:44,790 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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 39 [2022-04-15 13:05:44,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:44,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-15 13:05:44,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:44,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 13:05:44,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:44,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 13:05:44,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=896, Invalid=2410, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 13:05:44,843 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-15 13:05:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:52,889 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-15 13:05:52,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 13:05:52,889 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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 39 [2022-04-15 13:05:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-15 13:05:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions. [2022-04-15 13:05:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-15 13:05:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions. [2022-04-15 13:05:52,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 72 transitions. [2022-04-15 13:05:53,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:53,000 INFO L225 Difference]: With dead ends: 91 [2022-04-15 13:05:53,001 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 13:05:53,001 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1785, Invalid=5355, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 13:05:53,002 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:53,002 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 88 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 13:05:53,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 13:05:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-15 13:05:53,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:53,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:53,036 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:53,036 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:53,037 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-15 13:05:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 13:05:53,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:53,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:53,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 50 states. [2022-04-15 13:05:53,037 INFO L87 Difference]: Start difference. First operand has 49 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 50 states. [2022-04-15 13:05:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:53,038 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-15 13:05:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 13:05:53,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:53,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:53,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:53,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:05:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-04-15 13:05:53,039 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 39 [2022-04-15 13:05:53,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:53,039 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-04-15 13:05:53,039 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-15 13:05:53,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 53 transitions. [2022-04-15 13:05:53,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-15 13:05:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 13:05:53,179 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:53,179 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:53,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 13:05:53,380 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55 [2022-04-15 13:05:53,380 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:53,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:53,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1444653410, now seen corresponding path program 53 times [2022-04-15 13:05:53,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:53,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1375004997] [2022-04-15 13:05:53,411 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:05:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1258229827, now seen corresponding path program 1 times [2022-04-15 13:05:53,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:53,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317043428] [2022-04-15 13:05:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:53,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:05:53,418 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:05:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:05:53,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:05:53,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1444653410, now seen corresponding path program 54 times [2022-04-15 13:05:53,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:53,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664719268] [2022-04-15 13:05:53,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:53,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:53,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:53,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {13857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13824#true} is VALID [2022-04-15 13:05:53,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {13824#true} assume true; {13824#true} is VALID [2022-04-15 13:05:53,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13824#true} {13824#true} #63#return; {13824#true} is VALID [2022-04-15 13:05:53,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {13824#true} call ULTIMATE.init(); {13857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:53,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {13857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13824#true} is VALID [2022-04-15 13:05:53,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {13824#true} assume true; {13824#true} is VALID [2022-04-15 13:05:53,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13824#true} {13824#true} #63#return; {13824#true} is VALID [2022-04-15 13:05:53,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {13824#true} call #t~ret7 := main(); {13824#true} is VALID [2022-04-15 13:05:53,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {13824#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {13824#true} is VALID [2022-04-15 13:05:53,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {13824#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {13824#true} is VALID [2022-04-15 13:05:53,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {13824#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {13829#(= main_~z~0 0)} is VALID [2022-04-15 13:05:53,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {13829#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13830#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:05:53,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {13830#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13831#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:05:53,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {13831#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13832#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:05:53,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {13832#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13833#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:05:53,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {13833#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13834#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:05:53,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {13834#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13835#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:05:53,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {13835#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13836#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:05:53,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {13836#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13837#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:05:53,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {13837#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13838#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:05:53,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {13838#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13839#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:05:53,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {13839#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13840#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:05:53,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {13840#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13841#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:05:53,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {13841#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13842#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:05:53,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {13842#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13843#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:05:53,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {13843#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13844#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:05:53,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {13844#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13845#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:05:53,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {13845#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13846#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:05:53,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {13846#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13847#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:05:53,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {13847#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13848#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:05:53,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {13848#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13849#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:05:53,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {13849#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13850#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:05:53,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {13850#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13851#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:05:53,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {13851#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13852#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:05:53,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {13852#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13853#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:05:53,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {13853#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13854#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:05:53,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {13854#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13855#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:05:53,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {13855#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13856#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 27))} is VALID [2022-04-15 13:05:53,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {13856#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 27))} assume !(~z~0 % 4294967296 < 268435455); {13825#false} is VALID [2022-04-15 13:05:53,973 INFO L272 TraceCheckUtils]: 36: Hoare triple {13825#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {13825#false} is VALID [2022-04-15 13:05:53,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {13825#false} ~cond := #in~cond; {13825#false} is VALID [2022-04-15 13:05:53,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {13825#false} assume 0 == ~cond; {13825#false} is VALID [2022-04-15 13:05:53,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {13825#false} assume !false; {13825#false} is VALID [2022-04-15 13:05:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:53,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:53,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664719268] [2022-04-15 13:05:53,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664719268] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:05:53,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336547458] [2022-04-15 13:05:53,974 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:05:53,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:53,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:53,975 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:05:53,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 13:05:54,687 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-15 13:05:54,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:05:54,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 13:05:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:54,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:05:55,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {13824#true} call ULTIMATE.init(); {13824#true} is VALID [2022-04-15 13:05:55,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {13824#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13824#true} is VALID [2022-04-15 13:05:55,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {13824#true} assume true; {13824#true} is VALID [2022-04-15 13:05:55,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13824#true} {13824#true} #63#return; {13824#true} is VALID [2022-04-15 13:05:55,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {13824#true} call #t~ret7 := main(); {13824#true} is VALID [2022-04-15 13:05:55,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {13824#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {13824#true} is VALID [2022-04-15 13:05:55,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {13824#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {13824#true} is VALID [2022-04-15 13:05:55,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {13824#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {13829#(= main_~z~0 0)} is VALID [2022-04-15 13:05:55,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {13829#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13830#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:05:55,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {13830#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13831#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:05:55,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {13831#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13832#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:05:55,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {13832#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13833#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:05:55,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {13833#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13834#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:05:55,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {13834#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13835#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:05:55,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {13835#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13836#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:05:55,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {13836#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13837#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:05:55,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {13837#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13838#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:05:55,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {13838#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13839#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:05:55,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {13839#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13840#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:05:55,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {13840#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13841#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:05:55,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {13841#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13842#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:05:55,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {13842#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13843#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:05:55,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {13843#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13844#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:05:55,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {13844#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13845#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:05:55,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {13845#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13846#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:05:55,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {13846#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13847#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:05:55,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {13847#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13848#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:05:55,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {13848#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13849#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:05:55,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {13849#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13850#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:05:55,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {13850#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13851#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:05:55,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {13851#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13852#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:05:55,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {13852#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13853#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:05:55,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {13853#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13854#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:05:55,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {13854#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13855#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:05:55,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {13855#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13963#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:05:55,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {13963#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {13825#false} is VALID [2022-04-15 13:05:55,149 INFO L272 TraceCheckUtils]: 36: Hoare triple {13825#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {13825#false} is VALID [2022-04-15 13:05:55,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {13825#false} ~cond := #in~cond; {13825#false} is VALID [2022-04-15 13:05:55,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {13825#false} assume 0 == ~cond; {13825#false} is VALID [2022-04-15 13:05:55,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {13825#false} assume !false; {13825#false} is VALID [2022-04-15 13:05:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:55,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:06:03,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {13825#false} assume !false; {13825#false} is VALID [2022-04-15 13:06:03,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {13825#false} assume 0 == ~cond; {13825#false} is VALID [2022-04-15 13:06:03,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {13825#false} ~cond := #in~cond; {13825#false} is VALID [2022-04-15 13:06:03,325 INFO L272 TraceCheckUtils]: 36: Hoare triple {13825#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {13825#false} is VALID [2022-04-15 13:06:03,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {13991#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {13825#false} is VALID [2022-04-15 13:06:03,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {13995#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13991#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {13999#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13995#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {14003#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {13999#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {14007#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14003#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {14011#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14007#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {14015#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14011#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {14019#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14015#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {14023#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14019#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {14027#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14023#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {14031#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14027#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {14035#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14031#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {14039#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14035#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {14043#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14039#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {14047#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14043#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {14051#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14047#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {14055#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14051#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {14059#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14055#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {14063#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14059#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {14067#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14063#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {14071#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14067#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {14075#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14071#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {14079#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14075#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {14083#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14079#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {14087#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14083#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {14091#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14087#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {14095#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14091#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {14099#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14095#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {13824#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {14099#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} is VALID [2022-04-15 13:06:03,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {13824#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {13824#true} is VALID [2022-04-15 13:06:03,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {13824#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {13824#true} is VALID [2022-04-15 13:06:03,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {13824#true} call #t~ret7 := main(); {13824#true} is VALID [2022-04-15 13:06:03,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13824#true} {13824#true} #63#return; {13824#true} is VALID [2022-04-15 13:06:03,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {13824#true} assume true; {13824#true} is VALID [2022-04-15 13:06:03,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {13824#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13824#true} is VALID [2022-04-15 13:06:03,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {13824#true} call ULTIMATE.init(); {13824#true} is VALID [2022-04-15 13:06:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:03,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336547458] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:06:03,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:06:03,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-15 13:06:03,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:03,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1375004997] [2022-04-15 13:06:03,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1375004997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:03,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:03,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 13:06:03,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423375326] [2022-04-15 13:06:03,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:03,487 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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 40 [2022-04-15 13:06:03,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:03,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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-15 13:06:03,544 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-15 13:06:03,544 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 13:06:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:03,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 13:06:03,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=957, Invalid=2583, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 13:06:03,545 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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-15 13:06:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:13,453 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-04-15 13:06:13,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 13:06:13,453 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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 40 [2022-04-15 13:06:13,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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-15 13:06:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 73 transitions. [2022-04-15 13:06:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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-15 13:06:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 73 transitions. [2022-04-15 13:06:13,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 73 transitions. [2022-04-15 13:06:13,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:13,580 INFO L225 Difference]: With dead ends: 93 [2022-04-15 13:06:13,581 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 13:06:13,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1907, Invalid=5749, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 13:06:13,582 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:13,582 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 153 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 13:06:13,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 13:06:13,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 13:06:13,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:13,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:13,618 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:13,618 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:13,618 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-15 13:06:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-15 13:06:13,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:13,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:13,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 51 states. [2022-04-15 13:06:13,619 INFO L87 Difference]: Start difference. First operand has 50 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 51 states. [2022-04-15 13:06:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:13,620 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-15 13:06:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-15 13:06:13,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:13,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:13,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:13,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:13,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-15 13:06:13,621 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 40 [2022-04-15 13:06:13,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:13,621 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-15 13:06:13,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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-15 13:06:13,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-15 13:06:13,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 13:06:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 13:06:13,804 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:13,804 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:13,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 13:06:14,008 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57 [2022-04-15 13:06:14,009 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:14,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1860885314, now seen corresponding path program 55 times [2022-04-15 13:06:14,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:14,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [771533308] [2022-04-15 13:06:14,042 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1317335171, now seen corresponding path program 1 times [2022-04-15 13:06:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:14,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729855434] [2022-04-15 13:06:14,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:14,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:06:14,049 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:06:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:06:14,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:06:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1860885314, now seen corresponding path program 56 times [2022-04-15 13:06:14,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:14,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39847184] [2022-04-15 13:06:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:14,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:14,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:14,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {14605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14571#true} is VALID [2022-04-15 13:06:14,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {14571#true} assume true; {14571#true} is VALID [2022-04-15 13:06:14,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14571#true} {14571#true} #63#return; {14571#true} is VALID [2022-04-15 13:06:14,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {14571#true} call ULTIMATE.init(); {14605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:14,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {14605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14571#true} is VALID [2022-04-15 13:06:14,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {14571#true} assume true; {14571#true} is VALID [2022-04-15 13:06:14,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14571#true} {14571#true} #63#return; {14571#true} is VALID [2022-04-15 13:06:14,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {14571#true} call #t~ret7 := main(); {14571#true} is VALID [2022-04-15 13:06:14,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {14571#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {14571#true} is VALID [2022-04-15 13:06:14,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {14571#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {14571#true} is VALID [2022-04-15 13:06:14,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {14571#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {14576#(= main_~z~0 0)} is VALID [2022-04-15 13:06:14,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {14576#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14577#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:06:14,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {14577#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14578#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:06:14,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {14578#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14579#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:06:14,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {14579#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14580#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:06:14,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {14580#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14581#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:06:14,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {14581#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14582#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:06:14,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {14582#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14583#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:06:14,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {14583#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14584#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:06:14,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {14584#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14585#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:06:14,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {14585#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14586#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:06:14,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {14586#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14587#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:06:14,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {14587#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14588#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:06:14,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {14588#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14589#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:06:14,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {14589#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14590#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:06:14,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {14590#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14591#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:06:14,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {14591#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14592#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:06:14,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {14592#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14593#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:06:14,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {14593#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14594#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:06:14,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {14594#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14595#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:06:14,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {14595#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14596#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:06:14,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {14596#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14597#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:06:14,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {14597#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14598#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:06:14,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {14598#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14599#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:06:14,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {14599#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14600#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:06:14,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {14600#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14601#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:06:14,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {14601#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14602#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:06:14,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {14602#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14603#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:06:14,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {14603#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14604#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 28))} is VALID [2022-04-15 13:06:14,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {14604#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 28))} assume !(~z~0 % 4294967296 < 268435455); {14572#false} is VALID [2022-04-15 13:06:14,697 INFO L272 TraceCheckUtils]: 37: Hoare triple {14572#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {14572#false} is VALID [2022-04-15 13:06:14,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {14572#false} ~cond := #in~cond; {14572#false} is VALID [2022-04-15 13:06:14,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {14572#false} assume 0 == ~cond; {14572#false} is VALID [2022-04-15 13:06:14,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {14572#false} assume !false; {14572#false} is VALID [2022-04-15 13:06:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:14,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:14,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39847184] [2022-04-15 13:06:14,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39847184] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:06:14,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701123894] [2022-04-15 13:06:14,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:06:14,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:14,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:06:14,700 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:06:14,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 13:06:14,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:06:14,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:06:14,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 13:06:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:14,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:06:15,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {14571#true} call ULTIMATE.init(); {14571#true} is VALID [2022-04-15 13:06:15,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {14571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14571#true} is VALID [2022-04-15 13:06:15,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {14571#true} assume true; {14571#true} is VALID [2022-04-15 13:06:15,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14571#true} {14571#true} #63#return; {14571#true} is VALID [2022-04-15 13:06:15,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {14571#true} call #t~ret7 := main(); {14571#true} is VALID [2022-04-15 13:06:15,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {14571#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {14571#true} is VALID [2022-04-15 13:06:15,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {14571#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {14571#true} is VALID [2022-04-15 13:06:15,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {14571#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {14576#(= main_~z~0 0)} is VALID [2022-04-15 13:06:15,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {14576#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14577#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:06:15,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {14577#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14578#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:06:15,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {14578#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14579#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:06:15,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {14579#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14580#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:06:15,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {14580#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14581#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:06:15,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {14581#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14582#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:06:15,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {14582#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14583#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:06:15,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {14583#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14584#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:06:15,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {14584#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14585#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:06:15,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {14585#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14586#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:06:15,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {14586#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14587#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:06:15,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {14587#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14588#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:06:15,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {14588#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14589#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:06:15,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {14589#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14590#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:06:15,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {14590#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14591#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:06:15,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {14591#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14592#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:06:15,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {14592#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14593#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:06:15,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {14593#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14594#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:06:15,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {14594#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14595#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:06:15,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {14595#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14596#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:06:15,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {14596#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14597#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:06:15,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {14597#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14598#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:06:15,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {14598#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14599#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:06:15,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {14599#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14600#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:06:15,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {14600#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14601#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:06:15,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {14601#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14602#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:06:15,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {14602#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14603#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:06:15,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {14603#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14714#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:06:15,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {14714#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !(~z~0 % 4294967296 < 268435455); {14572#false} is VALID [2022-04-15 13:06:15,282 INFO L272 TraceCheckUtils]: 37: Hoare triple {14572#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {14572#false} is VALID [2022-04-15 13:06:15,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {14572#false} ~cond := #in~cond; {14572#false} is VALID [2022-04-15 13:06:15,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {14572#false} assume 0 == ~cond; {14572#false} is VALID [2022-04-15 13:06:15,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {14572#false} assume !false; {14572#false} is VALID [2022-04-15 13:06:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:15,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:06:26,667 INFO L290 TraceCheckUtils]: 40: Hoare triple {14572#false} assume !false; {14572#false} is VALID [2022-04-15 13:06:26,667 INFO L290 TraceCheckUtils]: 39: Hoare triple {14572#false} assume 0 == ~cond; {14572#false} is VALID [2022-04-15 13:06:26,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {14572#false} ~cond := #in~cond; {14572#false} is VALID [2022-04-15 13:06:26,667 INFO L272 TraceCheckUtils]: 37: Hoare triple {14572#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {14572#false} is VALID [2022-04-15 13:06:26,668 INFO L290 TraceCheckUtils]: 36: Hoare triple {14742#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {14572#false} is VALID [2022-04-15 13:06:26,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {14746#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14742#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {14750#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14746#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {14754#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14750#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {14758#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14754#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {14762#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14758#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {14766#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14762#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {14770#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14766#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {14774#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14770#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {14778#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14774#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {14782#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14778#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {14786#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14782#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {14790#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14786#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {14794#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14790#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {14798#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14794#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {14802#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14798#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {14806#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14802#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {14810#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14806#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {14814#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14810#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {14818#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14814#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {14822#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14818#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {14826#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14822#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {14830#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14826#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {14834#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14830#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {14838#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14834#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {14842#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14838#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {14846#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14842#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {14850#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14846#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {14854#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {14850#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {14571#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {14854#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} is VALID [2022-04-15 13:06:26,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {14571#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {14571#true} is VALID [2022-04-15 13:06:26,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {14571#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {14571#true} is VALID [2022-04-15 13:06:26,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {14571#true} call #t~ret7 := main(); {14571#true} is VALID [2022-04-15 13:06:26,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14571#true} {14571#true} #63#return; {14571#true} is VALID [2022-04-15 13:06:26,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {14571#true} assume true; {14571#true} is VALID [2022-04-15 13:06:26,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {14571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14571#true} is VALID [2022-04-15 13:06:26,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {14571#true} call ULTIMATE.init(); {14571#true} is VALID [2022-04-15 13:06:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:26,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701123894] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:06:26,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:06:26,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-15 13:06:26,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:26,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [771533308] [2022-04-15 13:06:26,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [771533308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:26,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:26,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 13:06:26,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68470725] [2022-04-15 13:06:26,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:26,809 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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 41 [2022-04-15 13:06:26,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:26,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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-15 13:06:26,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:26,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 13:06:26,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:26,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 13:06:26,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=2762, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 13:06:26,867 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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-15 13:06:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:38,688 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2022-04-15 13:06:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 13:06:38,688 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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 41 [2022-04-15 13:06:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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-15 13:06:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 74 transitions. [2022-04-15 13:06:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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-15 13:06:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 74 transitions. [2022-04-15 13:06:38,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 74 transitions. [2022-04-15 13:06:38,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:38,838 INFO L225 Difference]: With dead ends: 95 [2022-04-15 13:06:38,838 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 13:06:38,838 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=2033, Invalid=6157, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 13:06:38,839 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:38,839 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 158 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 13:06:38,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 13:06:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-04-15 13:06:38,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:38,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 51 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:38,878 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 51 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:38,878 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 51 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:38,879 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 13:06:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-15 13:06:38,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:38,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:38,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 52 states. [2022-04-15 13:06:38,880 INFO L87 Difference]: Start difference. First operand has 51 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 52 states. [2022-04-15 13:06:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:38,880 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 13:06:38,880 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-15 13:06:38,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:38,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:38,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:38,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-04-15 13:06:38,881 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 41 [2022-04-15 13:06:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:38,881 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-04-15 13:06:38,882 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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-15 13:06:38,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 55 transitions. [2022-04-15 13:06:39,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-15 13:06:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 13:06:39,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:39,034 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:39,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 13:06:39,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:39,247 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1879172450, now seen corresponding path program 57 times [2022-04-15 13:06:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:39,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [953602249] [2022-04-15 13:06:39,278 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:39,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1376440515, now seen corresponding path program 1 times [2022-04-15 13:06:39,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:39,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495563134] [2022-04-15 13:06:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:39,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:06:39,285 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:06:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:06:39,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:06:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1879172450, now seen corresponding path program 58 times [2022-04-15 13:06:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:39,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046661590] [2022-04-15 13:06:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:39,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:39,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {15371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15336#true} is VALID [2022-04-15 13:06:39,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {15336#true} assume true; {15336#true} is VALID [2022-04-15 13:06:39,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15336#true} {15336#true} #63#return; {15336#true} is VALID [2022-04-15 13:06:39,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {15336#true} call ULTIMATE.init(); {15371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:39,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {15371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15336#true} is VALID [2022-04-15 13:06:39,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {15336#true} assume true; {15336#true} is VALID [2022-04-15 13:06:39,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15336#true} {15336#true} #63#return; {15336#true} is VALID [2022-04-15 13:06:39,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {15336#true} call #t~ret7 := main(); {15336#true} is VALID [2022-04-15 13:06:39,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {15336#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {15336#true} is VALID [2022-04-15 13:06:39,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {15336#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {15336#true} is VALID [2022-04-15 13:06:39,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {15336#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {15341#(= main_~z~0 0)} is VALID [2022-04-15 13:06:39,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {15341#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15342#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:06:39,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {15342#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15343#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:06:39,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {15343#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15344#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:06:39,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {15344#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15345#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:06:39,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {15345#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15346#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:06:39,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {15346#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15347#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:06:39,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {15347#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15348#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:06:39,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {15348#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15349#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:06:39,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {15349#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15350#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:06:39,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {15350#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15351#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:06:39,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {15351#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15352#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:06:39,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {15352#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15353#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:06:39,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {15353#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15354#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:06:39,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {15354#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15355#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:06:39,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {15355#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15356#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:06:39,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {15356#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15357#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:06:39,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {15357#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15358#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:06:39,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {15358#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15359#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:06:39,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {15359#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15360#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:06:39,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {15360#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15361#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:06:39,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {15361#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15362#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:06:39,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {15362#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15363#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:06:39,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {15363#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15364#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:06:39,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {15364#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15365#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:06:39,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {15365#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15366#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:06:39,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {15366#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15367#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:06:39,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {15367#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15368#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:06:39,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {15368#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15369#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:06:39,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {15369#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15370#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 29))} is VALID [2022-04-15 13:06:39,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {15370#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 29))} assume !(~z~0 % 4294967296 < 268435455); {15337#false} is VALID [2022-04-15 13:06:39,915 INFO L272 TraceCheckUtils]: 38: Hoare triple {15337#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {15337#false} is VALID [2022-04-15 13:06:39,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {15337#false} ~cond := #in~cond; {15337#false} is VALID [2022-04-15 13:06:39,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {15337#false} assume 0 == ~cond; {15337#false} is VALID [2022-04-15 13:06:39,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {15337#false} assume !false; {15337#false} is VALID [2022-04-15 13:06:39,916 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:39,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:39,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046661590] [2022-04-15 13:06:39,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046661590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:06:39,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522933901] [2022-04-15 13:06:39,916 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:06:39,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:39,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:06:39,917 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:06:39,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 13:06:40,012 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:06:40,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:06:40,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-15 13:06:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:40,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:06:40,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {15336#true} call ULTIMATE.init(); {15336#true} is VALID [2022-04-15 13:06:40,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {15336#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15336#true} is VALID [2022-04-15 13:06:40,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {15336#true} assume true; {15336#true} is VALID [2022-04-15 13:06:40,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15336#true} {15336#true} #63#return; {15336#true} is VALID [2022-04-15 13:06:40,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {15336#true} call #t~ret7 := main(); {15336#true} is VALID [2022-04-15 13:06:40,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {15336#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {15336#true} is VALID [2022-04-15 13:06:40,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {15336#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {15336#true} is VALID [2022-04-15 13:06:40,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {15336#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {15341#(= main_~z~0 0)} is VALID [2022-04-15 13:06:40,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {15341#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15342#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:06:40,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {15342#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15343#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:06:40,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {15343#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15344#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:06:40,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {15344#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15345#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:06:40,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {15345#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15346#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:06:40,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {15346#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15347#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:06:40,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {15347#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15348#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:06:40,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {15348#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15349#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:06:40,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {15349#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15350#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:06:40,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {15350#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15351#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:06:40,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {15351#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15352#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:06:40,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {15352#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15353#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:06:40,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {15353#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15354#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:06:40,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {15354#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15355#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:06:40,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {15355#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15356#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:06:40,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {15356#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15357#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:06:40,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {15357#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15358#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:06:40,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {15358#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15359#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:06:40,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {15359#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15360#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:06:40,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {15360#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15361#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:06:40,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {15361#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15362#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:06:40,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {15362#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15363#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:06:40,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {15363#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15364#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:06:40,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {15364#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15365#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:06:40,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {15365#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15366#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:06:40,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {15366#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15367#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:06:40,501 INFO L290 TraceCheckUtils]: 34: Hoare triple {15367#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15368#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:06:40,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {15368#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15369#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:06:40,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {15369#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15483#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:06:40,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {15483#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {15337#false} is VALID [2022-04-15 13:06:40,507 INFO L272 TraceCheckUtils]: 38: Hoare triple {15337#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {15337#false} is VALID [2022-04-15 13:06:40,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {15337#false} ~cond := #in~cond; {15337#false} is VALID [2022-04-15 13:06:40,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {15337#false} assume 0 == ~cond; {15337#false} is VALID [2022-04-15 13:06:40,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {15337#false} assume !false; {15337#false} is VALID [2022-04-15 13:06:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:40,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:06:49,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {15337#false} assume !false; {15337#false} is VALID [2022-04-15 13:06:49,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {15337#false} assume 0 == ~cond; {15337#false} is VALID [2022-04-15 13:06:49,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {15337#false} ~cond := #in~cond; {15337#false} is VALID [2022-04-15 13:06:49,993 INFO L272 TraceCheckUtils]: 38: Hoare triple {15337#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {15337#false} is VALID [2022-04-15 13:06:49,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {15511#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {15337#false} is VALID [2022-04-15 13:06:49,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {15515#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15511#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {15519#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15515#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {15523#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15519#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {15527#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15523#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {15531#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15527#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {15535#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15531#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {15539#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15535#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {15543#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15539#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {15547#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15543#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {15551#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15547#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {15555#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15551#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {15559#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15555#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {15563#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15559#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {15567#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15563#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {15571#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15567#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {15575#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15571#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {15579#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15575#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {15583#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15579#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {15587#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15583#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {15591#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15587#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {15595#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15591#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {15599#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15595#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {15603#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15599#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {15607#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15603#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {15611#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15607#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {15615#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15611#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {15619#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15615#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {15623#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15619#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {15627#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {15623#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {15336#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {15627#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:06:50,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {15336#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {15336#true} is VALID [2022-04-15 13:06:50,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {15336#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {15336#true} is VALID [2022-04-15 13:06:50,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {15336#true} call #t~ret7 := main(); {15336#true} is VALID [2022-04-15 13:06:50,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15336#true} {15336#true} #63#return; {15336#true} is VALID [2022-04-15 13:06:50,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {15336#true} assume true; {15336#true} is VALID [2022-04-15 13:06:50,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {15336#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15336#true} is VALID [2022-04-15 13:06:50,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {15336#true} call ULTIMATE.init(); {15336#true} is VALID [2022-04-15 13:06:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:50,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522933901] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:06:50,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:06:50,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-15 13:06:50,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:50,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [953602249] [2022-04-15 13:06:50,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [953602249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:50,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:50,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 13:06:50,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892247437] [2022-04-15 13:06:50,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:50,071 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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 42 [2022-04-15 13:06:50,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:50,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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-15 13:06:50,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:50,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 13:06:50,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:50,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 13:06:50,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=2947, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 13:06:50,109 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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-15 13:06:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:56,341 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-04-15 13:06:56,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 13:06:56,341 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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 42 [2022-04-15 13:06:56,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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-15 13:06:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 75 transitions. [2022-04-15 13:06:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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-15 13:06:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 75 transitions. [2022-04-15 13:06:56,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 75 transitions. [2022-04-15 13:06:56,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:56,421 INFO L225 Difference]: With dead ends: 97 [2022-04-15 13:06:56,421 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 13:06:56,422 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2163, Invalid=6579, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 13:06:56,422 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:56,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 43 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 13:06:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 13:06:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-15 13:06:56,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:56,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:56,459 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:56,459 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:56,459 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-15 13:06:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-15 13:06:56,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:56,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:56,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 53 states. [2022-04-15 13:06:56,460 INFO L87 Difference]: Start difference. First operand has 52 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 53 states. [2022-04-15 13:06:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:56,460 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-15 13:06:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-15 13:06:56,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:56,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:56,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:56,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-15 13:06:56,461 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 42 [2022-04-15 13:06:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:56,461 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-15 13:06:56,462 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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-15 13:06:56,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-15 13:06:56,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:56,541 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-15 13:06:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 13:06:56,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:56,542 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:56,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 13:06:56,742 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:56,742 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:56,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1848893630, now seen corresponding path program 59 times [2022-04-15 13:06:56,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:56,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [798859915] [2022-04-15 13:06:56,772 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:56,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1435545859, now seen corresponding path program 1 times [2022-04-15 13:06:56,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:56,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159649766] [2022-04-15 13:06:56,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:56,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:06:56,779 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:06:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:06:56,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:06:56,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1848893630, now seen corresponding path program 60 times [2022-04-15 13:06:56,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:56,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418481947] [2022-04-15 13:06:56,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:56,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:57,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {16155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16119#true} is VALID [2022-04-15 13:06:57,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {16119#true} assume true; {16119#true} is VALID [2022-04-15 13:06:57,334 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16119#true} {16119#true} #63#return; {16119#true} is VALID [2022-04-15 13:06:57,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {16119#true} call ULTIMATE.init(); {16155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:57,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {16155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16119#true} is VALID [2022-04-15 13:06:57,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {16119#true} assume true; {16119#true} is VALID [2022-04-15 13:06:57,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16119#true} {16119#true} #63#return; {16119#true} is VALID [2022-04-15 13:06:57,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {16119#true} call #t~ret7 := main(); {16119#true} is VALID [2022-04-15 13:06:57,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {16119#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {16119#true} is VALID [2022-04-15 13:06:57,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {16119#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {16119#true} is VALID [2022-04-15 13:06:57,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {16119#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {16124#(= main_~z~0 0)} is VALID [2022-04-15 13:06:57,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {16124#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16125#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:06:57,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {16125#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16126#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:06:57,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {16126#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16127#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:06:57,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {16127#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16128#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:06:57,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {16128#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16129#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:06:57,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {16129#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16130#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:06:57,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {16130#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16131#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:06:57,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {16131#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16132#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:06:57,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {16132#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16133#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:06:57,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {16133#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16134#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:06:57,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {16134#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16135#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:06:57,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {16135#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16136#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:06:57,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {16136#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16137#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:06:57,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {16137#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16138#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:06:57,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {16138#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16139#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:06:57,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {16139#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16140#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:06:57,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {16140#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16141#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:06:57,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {16141#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16142#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:06:57,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {16142#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16143#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:06:57,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {16143#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16144#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:06:57,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {16144#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16145#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:06:57,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {16145#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16146#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:06:57,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {16146#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16147#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:06:57,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {16147#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16148#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:06:57,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {16148#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16149#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:06:57,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {16149#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16150#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:06:57,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {16150#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16151#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:06:57,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {16151#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16152#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:06:57,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {16152#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16153#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:06:57,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {16153#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16154#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 30))} is VALID [2022-04-15 13:06:57,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {16154#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 30))} assume !(~z~0 % 4294967296 < 268435455); {16120#false} is VALID [2022-04-15 13:06:57,414 INFO L272 TraceCheckUtils]: 39: Hoare triple {16120#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {16120#false} is VALID [2022-04-15 13:06:57,414 INFO L290 TraceCheckUtils]: 40: Hoare triple {16120#false} ~cond := #in~cond; {16120#false} is VALID [2022-04-15 13:06:57,414 INFO L290 TraceCheckUtils]: 41: Hoare triple {16120#false} assume 0 == ~cond; {16120#false} is VALID [2022-04-15 13:06:57,414 INFO L290 TraceCheckUtils]: 42: Hoare triple {16120#false} assume !false; {16120#false} is VALID [2022-04-15 13:06:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:57,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:57,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418481947] [2022-04-15 13:06:57,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418481947] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:06:57,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181573992] [2022-04-15 13:06:57,415 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:06:57,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:57,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:06:57,416 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:06:57,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 13:06:58,310 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 13:06:58,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:06:58,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-15 13:06:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:58,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:06:58,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {16119#true} call ULTIMATE.init(); {16119#true} is VALID [2022-04-15 13:06:58,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {16119#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16119#true} is VALID [2022-04-15 13:06:58,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {16119#true} assume true; {16119#true} is VALID [2022-04-15 13:06:58,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16119#true} {16119#true} #63#return; {16119#true} is VALID [2022-04-15 13:06:58,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {16119#true} call #t~ret7 := main(); {16119#true} is VALID [2022-04-15 13:06:58,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {16119#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {16119#true} is VALID [2022-04-15 13:06:58,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {16119#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {16119#true} is VALID [2022-04-15 13:06:58,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {16119#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {16124#(= main_~z~0 0)} is VALID [2022-04-15 13:06:58,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {16124#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16125#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:06:58,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {16125#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16126#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:06:58,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {16126#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16127#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:06:58,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {16127#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16128#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:06:58,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {16128#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16129#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:06:58,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {16129#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16130#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:06:58,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {16130#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16131#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:06:58,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {16131#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16132#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:06:58,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {16132#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16133#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:06:58,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {16133#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16134#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:06:58,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {16134#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16135#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:06:58,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {16135#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16136#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:06:58,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {16136#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16137#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:06:58,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {16137#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16138#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:06:58,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {16138#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16139#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:06:58,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {16139#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16140#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:06:58,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {16140#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16141#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:06:58,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {16141#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16142#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:06:58,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {16142#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16143#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:06:58,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {16143#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16144#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:06:58,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {16144#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16145#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:06:58,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {16145#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16146#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:06:58,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {16146#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16147#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:06:58,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {16147#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16148#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:06:58,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {16148#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16149#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:06:58,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {16149#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16150#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:06:58,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {16150#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16151#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:06:58,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {16151#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16152#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:06:58,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {16152#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16153#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:06:58,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {16153#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16270#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:06:58,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {16270#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !(~z~0 % 4294967296 < 268435455); {16120#false} is VALID [2022-04-15 13:06:58,686 INFO L272 TraceCheckUtils]: 39: Hoare triple {16120#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {16120#false} is VALID [2022-04-15 13:06:58,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {16120#false} ~cond := #in~cond; {16120#false} is VALID [2022-04-15 13:06:58,686 INFO L290 TraceCheckUtils]: 41: Hoare triple {16120#false} assume 0 == ~cond; {16120#false} is VALID [2022-04-15 13:06:58,686 INFO L290 TraceCheckUtils]: 42: Hoare triple {16120#false} assume !false; {16120#false} is VALID [2022-04-15 13:06:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:58,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:07:06,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {16120#false} assume !false; {16120#false} is VALID [2022-04-15 13:07:06,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {16289#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16120#false} is VALID [2022-04-15 13:07:06,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {16293#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16289#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:07:06,222 INFO L272 TraceCheckUtils]: 39: Hoare triple {16297#(= (mod main_~z~0 4) 0)} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {16293#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:07:06,222 INFO L290 TraceCheckUtils]: 38: Hoare triple {16301#(or (< (mod main_~z~0 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !(~z~0 % 4294967296 < 268435455); {16297#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:07:06,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {16305#(or (< (mod (+ main_~z~0 1) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16301#(or (< (mod main_~z~0 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:07:06,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {16309#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 2) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16305#(or (< (mod (+ main_~z~0 1) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:07:06,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {16313#(or (< (mod (+ main_~z~0 3) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16309#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 2) 4294967296) 268435455))} is VALID [2022-04-15 13:07:06,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {16317#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 4) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16313#(or (< (mod (+ main_~z~0 3) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:07:06,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {16321#(or (< (mod (+ 5 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16317#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 4) 4294967296) 268435455))} is VALID [2022-04-15 13:07:06,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {16325#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 6) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16321#(or (< (mod (+ 5 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:07:06,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {16329#(or (< (mod (+ 7 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16325#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 6) 4294967296) 268435455))} is VALID [2022-04-15 13:07:06,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {16333#(or (< (mod (+ main_~z~0 8) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16329#(or (< (mod (+ 7 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:07:06,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {16337#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ main_~z~0 9) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16333#(or (< (mod (+ main_~z~0 8) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:07:06,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {16341#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 10) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16337#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ main_~z~0 9) 4294967296) 268435455))} is VALID [2022-04-15 13:07:06,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {16345#(or (< (mod (+ main_~z~0 11) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16341#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 10) 4294967296) 268435455))} is VALID [2022-04-15 13:07:06,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {16349#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 12) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16345#(or (< (mod (+ main_~z~0 11) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:07:06,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {16353#(or (< (mod (+ main_~z~0 13) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16349#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 12) 4294967296) 268435455))} is VALID [2022-04-15 13:07:06,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {16357#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 14) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16353#(or (< (mod (+ main_~z~0 13) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:07:06,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {16361#(or (< (mod (+ main_~z~0 15) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16357#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 14) 4294967296) 268435455))} is VALID [2022-04-15 13:07:06,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {16365#(or (< (mod (+ main_~z~0 16) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16361#(or (< (mod (+ main_~z~0 15) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:07:06,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {16369#(or (< (mod (+ main_~z~0 17) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16365#(or (< (mod (+ main_~z~0 16) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:07:06,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {16373#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 18) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16369#(or (< (mod (+ main_~z~0 17) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:07:06,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {16377#(or (< (mod (+ 19 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16373#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 18) 4294967296) 268435455))} is VALID [2022-04-15 13:07:06,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {16381#(or (< (mod (+ main_~z~0 20) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16377#(or (< (mod (+ 19 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:07:06,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {16385#(or (< (mod (+ main_~z~0 21) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16381#(or (< (mod (+ main_~z~0 20) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:07:06,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {16389#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 22) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16385#(or (< (mod (+ main_~z~0 21) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:07:06,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {16393#(or (< (mod (+ 23 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16389#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 22) 4294967296) 268435455))} is VALID [2022-04-15 13:07:06,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {16397#(or (< (mod (+ main_~z~0 24) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16393#(or (< (mod (+ 23 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:07:06,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {16401#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ main_~z~0 25) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16397#(or (< (mod (+ main_~z~0 24) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:07:06,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {16405#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 26) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16401#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ main_~z~0 25) 4294967296) 268435455))} is VALID [2022-04-15 13:07:06,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {16409#(or (< (mod (+ main_~z~0 27) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16405#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 26) 4294967296) 268435455))} is VALID [2022-04-15 13:07:06,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {16413#(or (< (mod (+ main_~z~0 28) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16409#(or (< (mod (+ main_~z~0 27) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:07:06,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {16417#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ 29 main_~z~0) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16413#(or (< (mod (+ main_~z~0 28) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:07:06,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {16421#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ 30 main_~z~0) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16417#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ 29 main_~z~0) 4294967296) 268435455))} is VALID [2022-04-15 13:07:06,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {16119#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {16421#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ 30 main_~z~0) 4294967296) 268435455))} is VALID [2022-04-15 13:07:06,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {16119#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {16119#true} is VALID [2022-04-15 13:07:06,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {16119#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {16119#true} is VALID [2022-04-15 13:07:06,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {16119#true} call #t~ret7 := main(); {16119#true} is VALID [2022-04-15 13:07:06,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16119#true} {16119#true} #63#return; {16119#true} is VALID [2022-04-15 13:07:06,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {16119#true} assume true; {16119#true} is VALID [2022-04-15 13:07:06,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {16119#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16119#true} is VALID [2022-04-15 13:07:06,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {16119#true} call ULTIMATE.init(); {16119#true} is VALID [2022-04-15 13:07:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:07:06,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181573992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:07:06,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:07:06,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 36] total 69 [2022-04-15 13:07:06,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:06,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [798859915] [2022-04-15 13:07:06,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [798859915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:06,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:06,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 13:07:06,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325060018] [2022-04-15 13:07:06,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:06,458 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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 43 [2022-04-15 13:07:06,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:06,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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-15 13:07:06,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:06,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 13:07:06,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:06,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 13:07:06,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3518, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 13:07:06,499 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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-15 13:07:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:21,034 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-04-15 13:07:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 13:07:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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 43 [2022-04-15 13:07:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:07:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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-15 13:07:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 76 transitions. [2022-04-15 13:07:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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-15 13:07:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 76 transitions. [2022-04-15 13:07:21,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 76 transitions. [2022-04-15 13:07:21,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:21,191 INFO L225 Difference]: With dead ends: 99 [2022-04-15 13:07:21,191 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 13:07:21,191 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2327, Invalid=7573, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 13:07:21,192 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:07:21,192 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 123 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 13:07:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 13:07:21,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-15 13:07:21,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:07:21,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:07:21,229 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:07:21,229 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:07:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:21,231 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-15 13:07:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-15 13:07:21,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:21,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:21,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 54 states. [2022-04-15 13:07:21,231 INFO L87 Difference]: Start difference. First operand has 53 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 54 states. [2022-04-15 13:07:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:21,232 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-15 13:07:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-15 13:07:21,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:21,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:21,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:07:21,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:07:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:07:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-15 13:07:21,233 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 43 [2022-04-15 13:07:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:07:21,233 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-15 13:07:21,233 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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-15 13:07:21,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 57 transitions. [2022-04-15 13:07:21,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-15 13:07:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 13:07:21,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:21,368 INFO L499 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:07:21,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-15 13:07:21,573 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63 [2022-04-15 13:07:21,573 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:21,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:21,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1454825118, now seen corresponding path program 61 times [2022-04-15 13:07:21,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:21,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063654468] [2022-04-15 13:07:21,602 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:21,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1494651203, now seen corresponding path program 1 times [2022-04-15 13:07:21,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:21,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316003410] [2022-04-15 13:07:21,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:21,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:07:21,609 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:07:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:07:21,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:07:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1454825118, now seen corresponding path program 62 times [2022-04-15 13:07:21,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:21,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561139887] [2022-04-15 13:07:21,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:21,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:22,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:07:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:22,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {16960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16923#true} is VALID [2022-04-15 13:07:22,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {16923#true} assume true; {16923#true} is VALID [2022-04-15 13:07:22,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16923#true} {16923#true} #63#return; {16923#true} is VALID [2022-04-15 13:07:22,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {16923#true} call ULTIMATE.init(); {16960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:07:22,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {16960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16923#true} is VALID [2022-04-15 13:07:22,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {16923#true} assume true; {16923#true} is VALID [2022-04-15 13:07:22,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16923#true} {16923#true} #63#return; {16923#true} is VALID [2022-04-15 13:07:22,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {16923#true} call #t~ret7 := main(); {16923#true} is VALID [2022-04-15 13:07:22,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {16923#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {16923#true} is VALID [2022-04-15 13:07:22,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {16923#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {16923#true} is VALID [2022-04-15 13:07:22,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {16923#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {16928#(= main_~z~0 0)} is VALID [2022-04-15 13:07:22,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {16928#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16929#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:07:22,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {16929#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16930#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:07:22,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {16930#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16931#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:07:22,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {16931#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16932#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:07:22,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {16932#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16933#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:07:22,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {16933#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16934#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:07:22,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {16934#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16935#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:07:22,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {16935#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16936#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:07:22,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {16936#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16937#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:07:22,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {16937#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16938#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:07:22,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {16938#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16939#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:07:22,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {16939#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16940#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:07:22,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {16940#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16941#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:07:22,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {16941#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16942#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:07:22,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {16942#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16943#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:07:22,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {16943#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16944#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:07:22,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {16944#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16945#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:07:22,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {16945#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16946#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:07:22,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {16946#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16947#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:07:22,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {16947#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16948#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:07:22,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {16948#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16949#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:07:22,348 INFO L290 TraceCheckUtils]: 29: Hoare triple {16949#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16950#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:07:22,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {16950#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16951#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:07:22,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {16951#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16952#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:07:22,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {16952#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16953#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:07:22,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {16953#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16954#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:07:22,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {16954#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16955#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:07:22,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {16955#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16956#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:07:22,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {16956#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16957#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:07:22,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {16957#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16958#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:07:22,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {16958#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16959#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 31))} is VALID [2022-04-15 13:07:22,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {16959#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 31))} assume !(~z~0 % 4294967296 < 268435455); {16924#false} is VALID [2022-04-15 13:07:22,402 INFO L272 TraceCheckUtils]: 40: Hoare triple {16924#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {16924#false} is VALID [2022-04-15 13:07:22,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {16924#false} ~cond := #in~cond; {16924#false} is VALID [2022-04-15 13:07:22,402 INFO L290 TraceCheckUtils]: 42: Hoare triple {16924#false} assume 0 == ~cond; {16924#false} is VALID [2022-04-15 13:07:22,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {16924#false} assume !false; {16924#false} is VALID [2022-04-15 13:07:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:07:22,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:22,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561139887] [2022-04-15 13:07:22,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561139887] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:07:22,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881785933] [2022-04-15 13:07:22,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:07:22,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:22,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:07:22,404 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:07:22,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 13:07:22,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:07:22,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:07:22,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-15 13:07:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:22,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:07:22,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {16923#true} call ULTIMATE.init(); {16923#true} is VALID [2022-04-15 13:07:22,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {16923#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16923#true} is VALID [2022-04-15 13:07:22,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {16923#true} assume true; {16923#true} is VALID [2022-04-15 13:07:22,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16923#true} {16923#true} #63#return; {16923#true} is VALID [2022-04-15 13:07:22,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {16923#true} call #t~ret7 := main(); {16923#true} is VALID [2022-04-15 13:07:22,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {16923#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {16923#true} is VALID [2022-04-15 13:07:22,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {16923#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {16923#true} is VALID [2022-04-15 13:07:22,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {16923#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {16928#(= main_~z~0 0)} is VALID [2022-04-15 13:07:22,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {16928#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16929#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:07:22,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {16929#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16930#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:07:22,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {16930#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16931#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:07:22,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {16931#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16932#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:07:22,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {16932#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16933#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:07:22,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {16933#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16934#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:07:22,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {16934#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16935#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:07:22,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {16935#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16936#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:07:22,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {16936#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16937#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:07:22,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {16937#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16938#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:07:22,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {16938#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16939#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:07:22,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {16939#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16940#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:07:22,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {16940#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16941#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:07:22,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {16941#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16942#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:07:22,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {16942#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16943#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:07:22,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {16943#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16944#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:07:22,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {16944#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16945#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:07:22,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {16945#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16946#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:07:22,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {16946#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16947#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:07:23,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {16947#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16948#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:07:23,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {16948#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16949#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:07:23,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {16949#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16950#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:07:23,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {16950#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16951#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:07:23,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {16951#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16952#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:07:23,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {16952#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16953#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:07:23,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {16953#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16954#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:07:23,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {16954#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16955#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:07:23,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {16955#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16956#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:07:23,056 INFO L290 TraceCheckUtils]: 36: Hoare triple {16956#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16957#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:07:23,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {16957#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {16958#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:07:23,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {16958#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17078#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:07:23,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {17078#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !(~z~0 % 4294967296 < 268435455); {16924#false} is VALID [2022-04-15 13:07:23,068 INFO L272 TraceCheckUtils]: 40: Hoare triple {16924#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {16924#false} is VALID [2022-04-15 13:07:23,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {16924#false} ~cond := #in~cond; {16924#false} is VALID [2022-04-15 13:07:23,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {16924#false} assume 0 == ~cond; {16924#false} is VALID [2022-04-15 13:07:23,068 INFO L290 TraceCheckUtils]: 43: Hoare triple {16924#false} assume !false; {16924#false} is VALID [2022-04-15 13:07:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:07:23,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:07:41,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {16924#false} assume !false; {16924#false} is VALID [2022-04-15 13:07:41,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {16924#false} assume 0 == ~cond; {16924#false} is VALID [2022-04-15 13:07:41,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {16924#false} ~cond := #in~cond; {16924#false} is VALID [2022-04-15 13:07:41,777 INFO L272 TraceCheckUtils]: 40: Hoare triple {16924#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {16924#false} is VALID [2022-04-15 13:07:41,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {17106#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {16924#false} is VALID [2022-04-15 13:07:41,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {17110#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17106#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {17114#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17110#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {17118#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17114#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {17122#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17118#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {17126#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17122#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {17130#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17126#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {17134#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17130#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {17138#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17134#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {17142#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17138#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {17146#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17142#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {17150#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17146#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {17154#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17150#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {17158#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17154#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {17162#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17158#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {17166#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17162#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {17170#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17166#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {17174#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17170#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {17178#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17174#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {17182#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17178#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {17186#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17182#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {17190#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17186#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {17194#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17190#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {17198#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17194#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {17202#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17198#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {17206#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17202#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {17210#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17206#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {17214#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17210#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {17218#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17214#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {17222#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17218#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {17226#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17222#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {17230#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17226#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {16923#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {17230#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} is VALID [2022-04-15 13:07:41,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {16923#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {16923#true} is VALID [2022-04-15 13:07:41,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {16923#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {16923#true} is VALID [2022-04-15 13:07:41,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {16923#true} call #t~ret7 := main(); {16923#true} is VALID [2022-04-15 13:07:41,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16923#true} {16923#true} #63#return; {16923#true} is VALID [2022-04-15 13:07:41,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {16923#true} assume true; {16923#true} is VALID [2022-04-15 13:07:41,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {16923#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16923#true} is VALID [2022-04-15 13:07:41,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {16923#true} call ULTIMATE.init(); {16923#true} is VALID [2022-04-15 13:07:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:07:41,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881785933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:07:41,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:07:41,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-15 13:07:41,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:41,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063654468] [2022-04-15 13:07:41,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063654468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:41,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:41,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 13:07:41,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765740121] [2022-04-15 13:07:41,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:41,945 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 34 states have internal predecessors, (40), 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 44 [2022-04-15 13:07:41,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:41,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 34 states have internal predecessors, (40), 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-15 13:07:42,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:42,013 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 13:07:42,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:42,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 13:07:42,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1221, Invalid=3335, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 13:07:42,014 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 35 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 34 states have internal predecessors, (40), 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-15 13:07:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:55,357 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-04-15 13:07:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 13:07:55,357 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 34 states have internal predecessors, (40), 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 44 [2022-04-15 13:07:55,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:07:55,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 34 states have internal predecessors, (40), 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-15 13:07:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 77 transitions. [2022-04-15 13:07:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 34 states have internal predecessors, (40), 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-15 13:07:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 77 transitions. [2022-04-15 13:07:55,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 77 transitions. [2022-04-15 13:07:55,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:55,498 INFO L225 Difference]: With dead ends: 101 [2022-04-15 13:07:55,499 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 13:07:55,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=2435, Invalid=7465, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 13:07:55,500 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:07:55,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 78 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-04-15 13:07:55,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 13:07:55,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-15 13:07:55,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:07:55,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:07:55,538 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:07:55,538 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:07:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:55,539 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-15 13:07:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-04-15 13:07:55,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:55,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:55,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 55 states. [2022-04-15 13:07:55,539 INFO L87 Difference]: Start difference. First operand has 54 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 55 states. [2022-04-15 13:07:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:55,540 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-15 13:07:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-04-15 13:07:55,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:55,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:55,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:07:55,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:07:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:07:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-15 13:07:55,541 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 44 [2022-04-15 13:07:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:07:55,541 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-15 13:07:55,541 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 34 states have internal predecessors, (40), 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-15 13:07:55,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 58 transitions. [2022-04-15 13:07:55,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-15 13:07:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 13:07:55,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:55,708 INFO L499 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:07:55,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 13:07:55,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:55,908 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2123603134, now seen corresponding path program 63 times [2022-04-15 13:07:55,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:55,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [238569177] [2022-04-15 13:07:55,938 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1553756547, now seen corresponding path program 1 times [2022-04-15 13:07:55,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:55,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792294773] [2022-04-15 13:07:55,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:55,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:07:55,945 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:07:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:07:55,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:07:55,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2123603134, now seen corresponding path program 64 times [2022-04-15 13:07:55,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:55,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015772018] [2022-04-15 13:07:55,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:55,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:56,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:07:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:56,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {17780#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17742#true} is VALID [2022-04-15 13:07:56,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-15 13:07:56,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17742#true} {17742#true} #63#return; {17742#true} is VALID [2022-04-15 13:07:56,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {17742#true} call ULTIMATE.init(); {17780#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:07:56,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {17780#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17742#true} is VALID [2022-04-15 13:07:56,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-15 13:07:56,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17742#true} {17742#true} #63#return; {17742#true} is VALID [2022-04-15 13:07:56,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {17742#true} call #t~ret7 := main(); {17742#true} is VALID [2022-04-15 13:07:56,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {17742#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {17742#true} is VALID [2022-04-15 13:07:56,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {17742#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {17742#true} is VALID [2022-04-15 13:07:56,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {17742#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {17747#(= main_~z~0 0)} is VALID [2022-04-15 13:07:56,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {17747#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17748#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:07:56,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {17748#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17749#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:07:56,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {17749#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17750#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:07:56,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {17750#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17751#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:07:56,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {17751#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17752#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:07:56,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {17752#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17753#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:07:56,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {17753#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17754#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:07:56,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {17754#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17755#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:07:56,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {17755#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17756#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:07:56,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {17756#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17757#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:07:56,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {17757#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17758#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:07:56,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {17758#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17759#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:07:56,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {17759#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17760#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:07:56,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {17760#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17761#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:07:56,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {17761#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17762#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:07:56,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {17762#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17763#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:07:56,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {17763#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17764#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:07:56,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {17764#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17765#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:07:56,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {17765#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17766#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:07:56,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {17766#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17767#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:07:56,622 INFO L290 TraceCheckUtils]: 28: Hoare triple {17767#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17768#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:07:56,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {17768#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17769#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:07:56,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {17769#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17770#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:07:56,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {17770#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17771#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:07:56,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {17771#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17772#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:07:56,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {17772#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17773#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:07:56,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {17773#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17774#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:07:56,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {17774#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17775#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:07:56,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {17775#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17776#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:07:56,683 INFO L290 TraceCheckUtils]: 37: Hoare triple {17776#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17777#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:07:56,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {17777#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17778#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:07:56,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {17778#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17779#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 32))} is VALID [2022-04-15 13:07:56,689 INFO L290 TraceCheckUtils]: 40: Hoare triple {17779#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 32))} assume !(~z~0 % 4294967296 < 268435455); {17743#false} is VALID [2022-04-15 13:07:56,689 INFO L272 TraceCheckUtils]: 41: Hoare triple {17743#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {17743#false} is VALID [2022-04-15 13:07:56,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {17743#false} ~cond := #in~cond; {17743#false} is VALID [2022-04-15 13:07:56,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {17743#false} assume 0 == ~cond; {17743#false} is VALID [2022-04-15 13:07:56,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {17743#false} assume !false; {17743#false} is VALID [2022-04-15 13:07:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:07:56,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:56,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015772018] [2022-04-15 13:07:56,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015772018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:07:56,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865282503] [2022-04-15 13:07:56,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:07:56,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:56,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:07:56,691 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:07:56,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 13:07:56,821 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:07:56,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:07:56,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-15 13:07:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:56,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:07:57,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {17742#true} call ULTIMATE.init(); {17742#true} is VALID [2022-04-15 13:07:57,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {17742#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17742#true} is VALID [2022-04-15 13:07:57,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-15 13:07:57,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17742#true} {17742#true} #63#return; {17742#true} is VALID [2022-04-15 13:07:57,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {17742#true} call #t~ret7 := main(); {17742#true} is VALID [2022-04-15 13:07:57,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {17742#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {17742#true} is VALID [2022-04-15 13:07:57,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {17742#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {17742#true} is VALID [2022-04-15 13:07:57,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {17742#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {17747#(= main_~z~0 0)} is VALID [2022-04-15 13:07:57,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {17747#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17748#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:07:57,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {17748#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17749#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:07:57,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {17749#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17750#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:07:57,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {17750#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17751#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:07:57,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {17751#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17752#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:07:57,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {17752#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17753#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:07:57,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {17753#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17754#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:07:57,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {17754#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17755#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:07:57,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {17755#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17756#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:07:57,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {17756#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17757#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:07:57,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {17757#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17758#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:07:57,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {17758#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17759#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:07:57,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {17759#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17760#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:07:57,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {17760#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17761#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:07:57,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {17761#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17762#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:07:57,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {17762#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17763#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:07:57,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {17763#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17764#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:07:57,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {17764#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17765#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:07:57,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {17765#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17766#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:07:57,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {17766#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17767#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:07:57,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {17767#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17768#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:07:57,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {17768#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17769#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:07:57,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {17769#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17770#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:07:57,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {17770#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17771#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:07:57,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {17771#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17772#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:07:57,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {17772#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17773#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:07:57,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {17773#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17774#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:07:57,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {17774#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17775#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:07:57,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {17775#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17776#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:07:57,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {17776#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17777#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:07:57,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {17777#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17778#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:07:57,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {17778#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17901#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:07:57,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {17901#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !(~z~0 % 4294967296 < 268435455); {17901#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:07:57,451 INFO L272 TraceCheckUtils]: 41: Hoare triple {17901#(and (<= 32 main_~z~0) (<= main_~z~0 32))} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {17908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:07:57,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {17908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:07:57,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {17912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17743#false} is VALID [2022-04-15 13:07:57,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {17743#false} assume !false; {17743#false} is VALID [2022-04-15 13:07:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:07:57,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:07:57,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {17743#false} assume !false; {17743#false} is VALID [2022-04-15 13:07:57,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {17912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17743#false} is VALID [2022-04-15 13:07:57,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {17908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:07:57,809 INFO L272 TraceCheckUtils]: 41: Hoare triple {17928#(= (mod main_~z~0 4) 0)} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {17908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:07:57,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {17928#(= (mod main_~z~0 4) 0)} assume !(~z~0 % 4294967296 < 268435455); {17928#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:07:57,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {17935#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17928#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:07:57,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {17939#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17935#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:07:57,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {17943#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17939#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:07:57,821 INFO L290 TraceCheckUtils]: 36: Hoare triple {17928#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17943#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:07:57,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {17935#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17928#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:07:57,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {17939#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17935#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:07:57,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {17943#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17939#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:07:57,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {17928#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17943#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:07:57,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {17935#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17928#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:07:57,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {17939#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17935#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:07:57,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {17943#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17939#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:07:57,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {17928#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17943#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:07:57,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {17935#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17928#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:07:57,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {17939#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17935#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:07:57,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {17943#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17939#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:07:57,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {17928#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17943#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:07:57,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {17935#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17928#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:07:57,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {17939#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17935#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:07:57,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {17943#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17939#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:07:57,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {17928#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17943#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:07:57,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {17935#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17928#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:07:57,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {17939#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17935#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:07:57,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {17943#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17939#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:07:57,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {17928#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17943#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:07:57,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {17935#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17928#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:07:57,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {17939#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17935#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:07:57,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {17943#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17939#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:07:57,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {17928#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17943#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:07:57,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {17935#(= (mod (+ main_~z~0 1) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17928#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:07:57,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {17939#(= (mod (+ main_~z~0 2) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17935#(= (mod (+ main_~z~0 1) 4) 0)} is VALID [2022-04-15 13:07:57,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {17943#(= (mod (+ main_~z~0 3) 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17939#(= (mod (+ main_~z~0 2) 4) 0)} is VALID [2022-04-15 13:07:57,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {17928#(= (mod main_~z~0 4) 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {17943#(= (mod (+ main_~z~0 3) 4) 0)} is VALID [2022-04-15 13:07:57,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {17742#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {17928#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:07:57,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {17742#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {17742#true} is VALID [2022-04-15 13:07:57,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {17742#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {17742#true} is VALID [2022-04-15 13:07:57,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {17742#true} call #t~ret7 := main(); {17742#true} is VALID [2022-04-15 13:07:57,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17742#true} {17742#true} #63#return; {17742#true} is VALID [2022-04-15 13:07:57,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-15 13:07:57,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {17742#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17742#true} is VALID [2022-04-15 13:07:57,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {17742#true} call ULTIMATE.init(); {17742#true} is VALID [2022-04-15 13:07:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-15 13:07:57,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865282503] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:07:57,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:07:57,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37, 8] total 43 [2022-04-15 13:07:57,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:57,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [238569177] [2022-04-15 13:07:57,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [238569177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:57,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:57,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 13:07:57,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903647550] [2022-04-15 13:07:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:57,906 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 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 45 [2022-04-15 13:07:57,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:57,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 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-15 13:07:57,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:57,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 13:07:57,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:57,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 13:07:57,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1657, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 13:07:57,965 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 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-15 13:08:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:12,806 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-04-15 13:08:12,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 13:08:12,807 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 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 45 [2022-04-15 13:08:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:08:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 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-15 13:08:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 78 transitions. [2022-04-15 13:08:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 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-15 13:08:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 78 transitions. [2022-04-15 13:08:12,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 78 transitions. [2022-04-15 13:08:12,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:12,939 INFO L225 Difference]: With dead ends: 103 [2022-04-15 13:08:12,939 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 13:08:12,940 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=377, Invalid=5323, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 13:08:12,940 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:08:12,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 63 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-04-15 13:08:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 13:08:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-15 13:08:12,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:08:12,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:08:12,980 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:08:12,980 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:08:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:12,981 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-04-15 13:08:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-15 13:08:12,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:12,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:12,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 56 states. [2022-04-15 13:08:12,981 INFO L87 Difference]: Start difference. First operand has 55 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 56 states. [2022-04-15 13:08:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:12,982 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-04-15 13:08:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-15 13:08:12,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:12,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:12,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:08:12,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:08:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 48 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:08:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-04-15 13:08:12,983 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 45 [2022-04-15 13:08:12,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:08:12,983 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-04-15 13:08:12,983 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 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-15 13:08:12,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 59 transitions. [2022-04-15 13:08:13,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-04-15 13:08:13,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 13:08:13,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:08:13,174 INFO L499 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:08:13,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 13:08:13,374 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,SelfDestructingSolverStorable67,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:08:13,375 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:08:13,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:08:13,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1380885150, now seen corresponding path program 65 times [2022-04-15 13:08:13,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:13,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [638630976] [2022-04-15 13:08:13,405 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:08:13,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1612861891, now seen corresponding path program 1 times [2022-04-15 13:08:13,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:08:13,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787745133] [2022-04-15 13:08:13,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:13,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:08:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:08:13,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:08:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:08:13,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:08:13,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1380885150, now seen corresponding path program 66 times [2022-04-15 13:08:13,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:08:13,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390725790] [2022-04-15 13:08:13,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:13,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:08:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:14,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:08:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:14,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {18591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18552#true} is VALID [2022-04-15 13:08:14,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {18552#true} assume true; {18552#true} is VALID [2022-04-15 13:08:14,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18552#true} {18552#true} #63#return; {18552#true} is VALID [2022-04-15 13:08:14,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {18552#true} call ULTIMATE.init(); {18591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:08:14,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {18591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18552#true} is VALID [2022-04-15 13:08:14,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {18552#true} assume true; {18552#true} is VALID [2022-04-15 13:08:14,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18552#true} {18552#true} #63#return; {18552#true} is VALID [2022-04-15 13:08:14,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {18552#true} call #t~ret7 := main(); {18552#true} is VALID [2022-04-15 13:08:14,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {18552#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {18552#true} is VALID [2022-04-15 13:08:14,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {18552#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {18552#true} is VALID [2022-04-15 13:08:14,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {18552#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {18557#(= main_~z~0 0)} is VALID [2022-04-15 13:08:14,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {18557#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18558#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:08:14,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {18558#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18559#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:08:14,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {18559#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18560#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:08:14,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {18560#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18561#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:08:14,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {18561#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18562#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:08:14,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {18562#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18563#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:08:14,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {18563#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18564#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:08:14,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {18564#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18565#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:08:14,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {18565#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18566#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:08:14,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {18566#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18567#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:08:14,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {18567#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18568#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:08:14,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {18568#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18569#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:08:14,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {18569#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18570#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:08:14,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {18570#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18571#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:08:14,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {18571#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18572#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:08:14,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {18572#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18573#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:08:14,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {18573#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18574#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:08:14,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {18574#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18575#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:08:14,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {18575#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18576#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:08:14,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {18576#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18577#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:08:14,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {18577#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18578#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:08:14,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {18578#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18579#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:08:14,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {18579#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18580#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:08:14,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {18580#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18581#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:08:14,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {18581#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18582#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:08:14,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {18582#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18583#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:08:14,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {18583#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18584#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:08:14,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {18584#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18585#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:08:14,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {18585#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18586#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:08:14,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {18586#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18587#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:08:14,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {18587#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18588#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:08:14,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {18588#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18589#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:08:14,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {18589#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18590#(and (<= main_~z~0 33) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:08:14,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {18590#(and (<= main_~z~0 33) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {18553#false} is VALID [2022-04-15 13:08:14,190 INFO L272 TraceCheckUtils]: 42: Hoare triple {18553#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {18553#false} is VALID [2022-04-15 13:08:14,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {18553#false} ~cond := #in~cond; {18553#false} is VALID [2022-04-15 13:08:14,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {18553#false} assume 0 == ~cond; {18553#false} is VALID [2022-04-15 13:08:14,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {18553#false} assume !false; {18553#false} is VALID [2022-04-15 13:08:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:08:14,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:08:14,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390725790] [2022-04-15 13:08:14,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390725790] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:08:14,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395144337] [2022-04-15 13:08:14,191 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:08:14,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:08:14,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:08:14,192 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:08:14,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 13:08:16,518 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-15 13:08:16,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:08:16,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-15 13:08:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:16,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:08:16,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {18552#true} call ULTIMATE.init(); {18552#true} is VALID [2022-04-15 13:08:16,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {18552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18552#true} is VALID [2022-04-15 13:08:16,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {18552#true} assume true; {18552#true} is VALID [2022-04-15 13:08:16,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18552#true} {18552#true} #63#return; {18552#true} is VALID [2022-04-15 13:08:16,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {18552#true} call #t~ret7 := main(); {18552#true} is VALID [2022-04-15 13:08:16,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {18552#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {18552#true} is VALID [2022-04-15 13:08:16,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {18552#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {18552#true} is VALID [2022-04-15 13:08:16,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {18552#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {18557#(= main_~z~0 0)} is VALID [2022-04-15 13:08:16,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {18557#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18558#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:08:16,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {18558#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18559#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:08:16,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {18559#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18560#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:08:16,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {18560#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18561#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:08:16,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {18561#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18562#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:08:16,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {18562#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18563#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:08:16,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {18563#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18564#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:08:16,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {18564#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18565#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:08:16,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {18565#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18566#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:08:16,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {18566#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18567#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:08:16,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {18567#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18568#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:08:16,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {18568#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18569#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:08:16,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {18569#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18570#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:08:16,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {18570#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18571#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:08:16,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {18571#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18572#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:08:16,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {18572#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18573#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:08:16,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {18573#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18574#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:08:16,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {18574#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18575#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:08:16,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {18575#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18576#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:08:16,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {18576#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18577#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:08:16,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {18577#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18578#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:08:16,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {18578#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18579#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:08:17,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {18579#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18580#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:08:17,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {18580#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18581#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:08:17,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {18581#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18582#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:08:17,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {18582#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18583#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:08:17,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {18583#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18584#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:08:17,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {18584#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18585#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:08:17,027 INFO L290 TraceCheckUtils]: 36: Hoare triple {18585#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18586#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:08:17,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {18586#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18587#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:08:17,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {18587#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18588#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:08:17,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {18588#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18589#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:08:17,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {18589#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18715#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-15 13:08:17,042 INFO L290 TraceCheckUtils]: 41: Hoare triple {18715#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !(~z~0 % 4294967296 < 268435455); {18553#false} is VALID [2022-04-15 13:08:17,042 INFO L272 TraceCheckUtils]: 42: Hoare triple {18553#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {18553#false} is VALID [2022-04-15 13:08:17,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {18553#false} ~cond := #in~cond; {18553#false} is VALID [2022-04-15 13:08:17,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {18553#false} assume 0 == ~cond; {18553#false} is VALID [2022-04-15 13:08:17,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {18553#false} assume !false; {18553#false} is VALID [2022-04-15 13:08:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:08:17,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:08:42,049 INFO L290 TraceCheckUtils]: 45: Hoare triple {18553#false} assume !false; {18553#false} is VALID [2022-04-15 13:08:42,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {18553#false} assume 0 == ~cond; {18553#false} is VALID [2022-04-15 13:08:42,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {18553#false} ~cond := #in~cond; {18553#false} is VALID [2022-04-15 13:08:42,050 INFO L272 TraceCheckUtils]: 42: Hoare triple {18553#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {18553#false} is VALID [2022-04-15 13:08:42,050 INFO L290 TraceCheckUtils]: 41: Hoare triple {18743#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {18553#false} is VALID [2022-04-15 13:08:42,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {18747#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18743#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {18751#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18747#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {18755#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18751#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {18759#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18755#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {18763#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18759#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {18767#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18763#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {18771#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18767#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {18775#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18771#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {18779#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18775#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {18783#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18779#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {18787#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18783#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {18791#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18787#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {18795#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18791#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {18799#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18795#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {18803#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18799#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {18807#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18803#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {18811#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18807#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {18815#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18811#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {18819#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18815#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {18823#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18819#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {18827#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18823#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {18831#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18827#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {18835#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18831#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {18839#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18835#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {18843#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18839#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {18847#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18843#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {18851#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18847#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {18855#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18851#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {18859#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18855#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {18863#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18859#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {18867#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18863#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {18871#(< (mod (+ 32 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18867#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {18875#(< (mod (+ main_~z~0 33) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {18871#(< (mod (+ 32 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {18552#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {18875#(< (mod (+ main_~z~0 33) 4294967296) 268435455)} is VALID [2022-04-15 13:08:42,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {18552#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {18552#true} is VALID [2022-04-15 13:08:42,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {18552#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {18552#true} is VALID [2022-04-15 13:08:42,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {18552#true} call #t~ret7 := main(); {18552#true} is VALID [2022-04-15 13:08:42,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18552#true} {18552#true} #63#return; {18552#true} is VALID [2022-04-15 13:08:42,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {18552#true} assume true; {18552#true} is VALID [2022-04-15 13:08:42,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {18552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18552#true} is VALID [2022-04-15 13:08:42,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {18552#true} call ULTIMATE.init(); {18552#true} is VALID [2022-04-15 13:08:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:08:42,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395144337] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:08:42,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:08:42,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 72 [2022-04-15 13:08:42,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:08:42,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [638630976] [2022-04-15 13:08:42,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [638630976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:08:42,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:08:42,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 13:08:42,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746640294] [2022-04-15 13:08:42,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:08:42,429 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 36 states have internal predecessors, (42), 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 46 [2022-04-15 13:08:42,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:08:42,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 36 states have internal predecessors, (42), 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-15 13:08:42,527 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-15 13:08:42,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 13:08:42,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:42,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 13:08:42,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1365, Invalid=3747, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 13:08:42,529 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 36 states have internal predecessors, (42), 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-15 13:09:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:08,824 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-04-15 13:09:08,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 13:09:08,824 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 36 states have internal predecessors, (42), 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 46 [2022-04-15 13:09:08,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 36 states have internal predecessors, (42), 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-15 13:09:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 79 transitions. [2022-04-15 13:09:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 36 states have internal predecessors, (42), 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-15 13:09:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 79 transitions. [2022-04-15 13:09:08,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 79 transitions. [2022-04-15 13:09:09,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:09,028 INFO L225 Difference]: With dead ends: 105 [2022-04-15 13:09:09,028 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 13:09:09,029 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=2723, Invalid=8407, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 13:09:09,029 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:09,030 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 73 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-04-15 13:09:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 13:09:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-15 13:09:09,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:09,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 56 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:09:09,070 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 56 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:09:09,070 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 56 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:09:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:09,071 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-15 13:09:09,071 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-15 13:09:09,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:09,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:09,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 57 states. [2022-04-15 13:09:09,072 INFO L87 Difference]: Start difference. First operand has 56 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 57 states. [2022-04-15 13:09:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:09,072 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-15 13:09:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-15 13:09:09,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:09,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:09,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:09,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:09:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-15 13:09:09,073 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 46 [2022-04-15 13:09:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:09,074 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-15 13:09:09,074 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 36 states have internal predecessors, (42), 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-15 13:09:09,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-15 13:09:09,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-15 13:09:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 13:09:09,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:09,390 INFO L499 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:09,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 13:09:09,590 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69 [2022-04-15 13:09:09,590 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:09,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash 168535874, now seen corresponding path program 67 times [2022-04-15 13:09:09,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:09,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [816908928] [2022-04-15 13:09:09,620 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:09:09,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1671967235, now seen corresponding path program 1 times [2022-04-15 13:09:09,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:09,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745321064] [2022-04-15 13:09:09,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:09,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:09:09,626 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:09:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:09:09,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:09:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash 168535874, now seen corresponding path program 68 times [2022-04-15 13:09:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:09,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462693917] [2022-04-15 13:09:09,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:09,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:09:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:10,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {19447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19407#true} is VALID [2022-04-15 13:09:10,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {19407#true} assume true; {19407#true} is VALID [2022-04-15 13:09:10,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19407#true} {19407#true} #63#return; {19407#true} is VALID [2022-04-15 13:09:10,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {19407#true} call ULTIMATE.init(); {19447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:09:10,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {19447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19407#true} is VALID [2022-04-15 13:09:10,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {19407#true} assume true; {19407#true} is VALID [2022-04-15 13:09:10,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19407#true} {19407#true} #63#return; {19407#true} is VALID [2022-04-15 13:09:10,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {19407#true} call #t~ret7 := main(); {19407#true} is VALID [2022-04-15 13:09:10,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {19407#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {19407#true} is VALID [2022-04-15 13:09:10,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {19407#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {19407#true} is VALID [2022-04-15 13:09:10,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {19407#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {19412#(= main_~z~0 0)} is VALID [2022-04-15 13:09:10,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {19412#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19413#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:09:10,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {19413#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19414#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:09:10,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {19414#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19415#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:09:10,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {19415#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19416#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:09:10,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {19416#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19417#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:09:10,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {19417#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19418#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:09:10,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {19418#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19419#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:09:10,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {19419#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19420#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:09:10,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {19420#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19421#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:09:10,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {19421#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19422#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:09:10,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {19422#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19423#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:09:10,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {19423#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19424#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:09:10,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {19424#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19425#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:09:10,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {19425#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19426#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:09:10,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {19426#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19427#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:09:10,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {19427#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19428#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:09:10,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {19428#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19429#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:09:10,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {19429#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19430#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:09:10,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {19430#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19431#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:09:10,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {19431#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19432#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:09:10,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {19432#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19433#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:09:10,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {19433#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19434#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:09:10,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {19434#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19435#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:09:10,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {19435#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19436#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:09:10,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {19436#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19437#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:09:10,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {19437#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19438#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:09:10,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {19438#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19439#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:09:10,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {19439#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19440#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:09:10,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {19440#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19441#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:09:10,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {19441#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19442#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:09:10,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {19442#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19443#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:09:10,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {19443#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19444#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:09:10,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {19444#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19445#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-15 13:09:10,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {19445#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19446#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 34))} is VALID [2022-04-15 13:09:10,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {19446#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 34))} assume !(~z~0 % 4294967296 < 268435455); {19408#false} is VALID [2022-04-15 13:09:10,605 INFO L272 TraceCheckUtils]: 43: Hoare triple {19408#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {19408#false} is VALID [2022-04-15 13:09:10,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {19408#false} ~cond := #in~cond; {19408#false} is VALID [2022-04-15 13:09:10,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {19408#false} assume 0 == ~cond; {19408#false} is VALID [2022-04-15 13:09:10,605 INFO L290 TraceCheckUtils]: 46: Hoare triple {19408#false} assume !false; {19408#false} is VALID [2022-04-15 13:09:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:10,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:10,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462693917] [2022-04-15 13:09:10,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462693917] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:09:10,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429020429] [2022-04-15 13:09:10,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:09:10,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:09:10,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:09:10,607 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:09:10,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 13:09:10,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:09:10,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:09:10,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-15 13:09:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:10,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:09:11,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {19407#true} call ULTIMATE.init(); {19407#true} is VALID [2022-04-15 13:09:11,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {19407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19407#true} is VALID [2022-04-15 13:09:11,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {19407#true} assume true; {19407#true} is VALID [2022-04-15 13:09:11,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19407#true} {19407#true} #63#return; {19407#true} is VALID [2022-04-15 13:09:11,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {19407#true} call #t~ret7 := main(); {19407#true} is VALID [2022-04-15 13:09:11,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {19407#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {19407#true} is VALID [2022-04-15 13:09:11,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {19407#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {19407#true} is VALID [2022-04-15 13:09:11,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {19407#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {19412#(= main_~z~0 0)} is VALID [2022-04-15 13:09:11,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {19412#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19413#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:09:11,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {19413#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19414#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:09:11,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {19414#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19415#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:09:11,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {19415#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19416#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:09:11,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {19416#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19417#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:09:11,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {19417#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19418#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:09:11,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {19418#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19419#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:09:11,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {19419#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19420#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:09:11,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {19420#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19421#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:09:11,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {19421#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19422#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:09:11,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {19422#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19423#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:09:11,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {19423#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19424#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:09:11,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {19424#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19425#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:09:11,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {19425#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19426#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:09:11,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {19426#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19427#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:09:11,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {19427#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19428#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:09:11,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {19428#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19429#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:09:11,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {19429#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19430#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:09:11,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {19430#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19431#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:09:11,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {19431#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19432#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:09:11,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {19432#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19433#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:09:11,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {19433#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19434#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:09:11,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {19434#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19435#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:09:11,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {19435#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19436#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:09:11,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {19436#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19437#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:09:11,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {19437#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19438#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:09:11,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {19438#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19439#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:09:11,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {19439#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19440#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:09:11,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {19440#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19441#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:09:11,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {19441#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19442#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:09:11,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {19442#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19443#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:09:11,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {19443#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19444#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:09:11,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {19444#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19445#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-15 13:09:11,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {19445#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19574#(and (<= main_~z~0 34) (<= 34 main_~z~0))} is VALID [2022-04-15 13:09:11,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {19574#(and (<= main_~z~0 34) (<= 34 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {19408#false} is VALID [2022-04-15 13:09:11,389 INFO L272 TraceCheckUtils]: 43: Hoare triple {19408#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {19408#false} is VALID [2022-04-15 13:09:11,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {19408#false} ~cond := #in~cond; {19408#false} is VALID [2022-04-15 13:09:11,389 INFO L290 TraceCheckUtils]: 45: Hoare triple {19408#false} assume 0 == ~cond; {19408#false} is VALID [2022-04-15 13:09:11,389 INFO L290 TraceCheckUtils]: 46: Hoare triple {19408#false} assume !false; {19408#false} is VALID [2022-04-15 13:09:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:11,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:09:57,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {19408#false} assume !false; {19408#false} is VALID [2022-04-15 13:09:57,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {19408#false} assume 0 == ~cond; {19408#false} is VALID [2022-04-15 13:09:57,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {19408#false} ~cond := #in~cond; {19408#false} is VALID [2022-04-15 13:09:57,752 INFO L272 TraceCheckUtils]: 43: Hoare triple {19408#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {19408#false} is VALID [2022-04-15 13:09:57,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {19602#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {19408#false} is VALID [2022-04-15 13:09:57,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {19606#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19602#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {19610#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19606#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {19614#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19610#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {19618#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19614#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {19622#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19618#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {19626#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19622#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {19630#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19626#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {19634#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19630#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {19638#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19634#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {19642#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19638#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {19646#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19642#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {19650#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19646#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {19654#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19650#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {19658#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19654#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {19662#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19658#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {19666#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19662#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {19670#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19666#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {19674#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19670#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {19678#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19674#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:09:57,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {19682#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19678#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {19686#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19682#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {19690#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19686#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {19694#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19690#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {19698#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19694#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {19702#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19698#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {19706#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19702#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {19710#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19706#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {19714#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19710#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {19718#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19714#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {19722#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19718#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {19726#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19722#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {19730#(< (mod (+ 32 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19726#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {19734#(< (mod (+ main_~z~0 33) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19730#(< (mod (+ 32 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {19738#(< (mod (+ main_~z~0 34) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {19734#(< (mod (+ main_~z~0 33) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {19407#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {19738#(< (mod (+ main_~z~0 34) 4294967296) 268435455)} is VALID [2022-04-15 13:09:58,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {19407#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {19407#true} is VALID [2022-04-15 13:09:58,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {19407#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {19407#true} is VALID [2022-04-15 13:09:58,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {19407#true} call #t~ret7 := main(); {19407#true} is VALID [2022-04-15 13:09:58,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19407#true} {19407#true} #63#return; {19407#true} is VALID [2022-04-15 13:09:58,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {19407#true} assume true; {19407#true} is VALID [2022-04-15 13:09:58,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {19407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19407#true} is VALID [2022-04-15 13:09:58,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {19407#true} call ULTIMATE.init(); {19407#true} is VALID [2022-04-15 13:09:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:58,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429020429] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:09:58,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:09:58,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-15 13:09:58,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:58,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [816908928] [2022-04-15 13:09:58,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [816908928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:58,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:58,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 13:09:58,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973021498] [2022-04-15 13:09:58,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:58,145 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 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 47 [2022-04-15 13:09:58,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:58,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 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-15 13:09:58,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:58,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 13:09:58,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:58,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 13:09:58,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1440, Invalid=3962, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 13:09:58,234 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 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-15 13:10:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:28,857 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-04-15 13:10:28,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 13:10:28,858 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 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 47 [2022-04-15 13:10:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:10:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 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-15 13:10:28,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 80 transitions. [2022-04-15 13:10:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 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-15 13:10:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 80 transitions. [2022-04-15 13:10:28,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 80 transitions. [2022-04-15 13:10:29,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:10:29,096 INFO L225 Difference]: With dead ends: 107 [2022-04-15 13:10:29,096 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 13:10:29,097 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 46.5s TimeCoverageRelationStatistics Valid=2873, Invalid=8899, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 13:10:29,097 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:10:29,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 103 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2022-04-15 13:10:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 13:10:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-04-15 13:10:29,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:10:29,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 57 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:10:29,145 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 57 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:10:29,145 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 57 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:10:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:29,146 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 13:10:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 13:10:29,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:29,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:29,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 58 states. [2022-04-15 13:10:29,146 INFO L87 Difference]: Start difference. First operand has 57 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 58 states. [2022-04-15 13:10:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:29,147 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 13:10:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 13:10:29,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:29,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:29,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:10:29,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:10:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:10:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-04-15 13:10:29,148 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 47 [2022-04-15 13:10:29,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:10:29,148 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-04-15 13:10:29,148 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 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-15 13:10:29,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 61 transitions. [2022-04-15 13:10:29,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:10:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-15 13:10:29,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 13:10:29,469 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:10:29,469 INFO L499 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:10:29,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 13:10:29,669 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:10:29,670 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:10:29,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:10:29,670 INFO L85 PathProgramCache]: Analyzing trace with hash 955947362, now seen corresponding path program 69 times [2022-04-15 13:10:29,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:29,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [323282537] [2022-04-15 13:10:29,699 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:10:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1731072579, now seen corresponding path program 1 times [2022-04-15 13:10:29,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:10:29,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687833796] [2022-04-15 13:10:29,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:29,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:10:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:10:29,704 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:10:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:10:29,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:10:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash 955947362, now seen corresponding path program 70 times [2022-04-15 13:10:29,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:10:29,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83361272] [2022-04-15 13:10:29,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:29,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:10:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:30,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:10:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:30,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {20321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20280#true} is VALID [2022-04-15 13:10:30,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {20280#true} assume true; {20280#true} is VALID [2022-04-15 13:10:30,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20280#true} {20280#true} #63#return; {20280#true} is VALID [2022-04-15 13:10:30,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {20280#true} call ULTIMATE.init(); {20321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:10:30,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {20321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20280#true} is VALID [2022-04-15 13:10:30,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {20280#true} assume true; {20280#true} is VALID [2022-04-15 13:10:30,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20280#true} {20280#true} #63#return; {20280#true} is VALID [2022-04-15 13:10:30,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {20280#true} call #t~ret7 := main(); {20280#true} is VALID [2022-04-15 13:10:30,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {20280#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {20280#true} is VALID [2022-04-15 13:10:30,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {20280#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {20280#true} is VALID [2022-04-15 13:10:30,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {20280#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {20285#(= main_~z~0 0)} is VALID [2022-04-15 13:10:30,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {20285#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20286#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:10:30,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {20286#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20287#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:10:30,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {20287#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20288#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:10:30,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {20288#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20289#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:10:30,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {20289#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20290#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:10:30,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {20290#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20291#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:10:30,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {20291#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20292#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:10:30,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {20292#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20293#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:10:30,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {20293#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20294#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:10:30,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {20294#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20295#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:10:30,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {20295#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20296#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:10:30,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {20296#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20297#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:10:30,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {20297#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20298#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:10:30,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {20298#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20299#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:10:30,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {20299#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20300#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:10:30,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {20300#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20301#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:10:30,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {20301#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20302#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:10:30,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {20302#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20303#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:10:30,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {20303#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20304#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:10:30,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {20304#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20305#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:10:30,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {20305#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20306#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:10:30,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {20306#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20307#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:10:30,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {20307#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20308#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:10:30,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {20308#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20309#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:10:30,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {20309#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20310#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:10:30,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {20310#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20311#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:10:30,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {20311#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20312#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:10:30,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {20312#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20313#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:10:30,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {20313#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20314#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:10:30,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {20314#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20315#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:10:30,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {20315#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20316#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:10:30,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {20316#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20317#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:10:30,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {20317#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20318#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-15 13:10:30,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {20318#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20319#(and (<= main_~z~0 34) (<= 34 main_~z~0))} is VALID [2022-04-15 13:10:30,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {20319#(and (<= main_~z~0 34) (<= 34 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20320#(and (<= main_~z~0 35) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:10:30,744 INFO L290 TraceCheckUtils]: 43: Hoare triple {20320#(and (<= main_~z~0 35) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {20281#false} is VALID [2022-04-15 13:10:30,744 INFO L272 TraceCheckUtils]: 44: Hoare triple {20281#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {20281#false} is VALID [2022-04-15 13:10:30,744 INFO L290 TraceCheckUtils]: 45: Hoare triple {20281#false} ~cond := #in~cond; {20281#false} is VALID [2022-04-15 13:10:30,744 INFO L290 TraceCheckUtils]: 46: Hoare triple {20281#false} assume 0 == ~cond; {20281#false} is VALID [2022-04-15 13:10:30,744 INFO L290 TraceCheckUtils]: 47: Hoare triple {20281#false} assume !false; {20281#false} is VALID [2022-04-15 13:10:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:10:30,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:10:30,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83361272] [2022-04-15 13:10:30,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83361272] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:10:30,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136622208] [2022-04-15 13:10:30,745 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:10:30,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:10:30,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:10:30,746 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:10:30,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 13:10:30,866 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:10:30,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:10:30,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-15 13:10:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:30,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:10:31,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {20280#true} call ULTIMATE.init(); {20280#true} is VALID [2022-04-15 13:10:31,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {20280#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20280#true} is VALID [2022-04-15 13:10:31,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {20280#true} assume true; {20280#true} is VALID [2022-04-15 13:10:31,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20280#true} {20280#true} #63#return; {20280#true} is VALID [2022-04-15 13:10:31,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {20280#true} call #t~ret7 := main(); {20280#true} is VALID [2022-04-15 13:10:31,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {20280#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {20280#true} is VALID [2022-04-15 13:10:31,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {20280#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {20280#true} is VALID [2022-04-15 13:10:31,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {20280#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {20285#(= main_~z~0 0)} is VALID [2022-04-15 13:10:31,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {20285#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20286#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:10:31,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {20286#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20287#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:10:31,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {20287#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20288#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:10:31,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {20288#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20289#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:10:31,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {20289#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20290#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:10:31,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {20290#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20291#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:10:31,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {20291#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20292#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:10:31,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {20292#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20293#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:10:31,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {20293#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20294#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:10:31,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {20294#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20295#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:10:31,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {20295#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20296#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:10:31,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {20296#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20297#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:10:31,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {20297#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20298#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:10:31,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {20298#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20299#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:10:31,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {20299#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20300#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:10:31,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {20300#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20301#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:10:31,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {20301#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20302#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:10:31,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {20302#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20303#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:10:31,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {20303#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20304#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:10:31,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {20304#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20305#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:10:31,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {20305#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20306#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:10:31,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {20306#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20307#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:10:31,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {20307#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20308#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:10:31,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {20308#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20309#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:10:31,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {20309#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20310#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:10:31,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {20310#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20311#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:10:31,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {20311#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20312#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:10:31,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {20312#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20313#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:10:31,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {20313#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20314#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:10:31,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {20314#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20315#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:10:31,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {20315#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20316#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:10:31,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {20316#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20317#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:10:31,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {20317#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20318#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-15 13:10:31,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {20318#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20319#(and (<= main_~z~0 34) (<= 34 main_~z~0))} is VALID [2022-04-15 13:10:31,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {20319#(and (<= main_~z~0 34) (<= 34 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20451#(and (<= main_~z~0 35) (<= 35 main_~z~0))} is VALID [2022-04-15 13:10:31,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {20451#(and (<= main_~z~0 35) (<= 35 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {20281#false} is VALID [2022-04-15 13:10:31,539 INFO L272 TraceCheckUtils]: 44: Hoare triple {20281#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {20281#false} is VALID [2022-04-15 13:10:31,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {20281#false} ~cond := #in~cond; {20281#false} is VALID [2022-04-15 13:10:31,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {20281#false} assume 0 == ~cond; {20281#false} is VALID [2022-04-15 13:10:31,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {20281#false} assume !false; {20281#false} is VALID [2022-04-15 13:10:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:10:31,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:11:42,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {20281#false} assume !false; {20281#false} is VALID [2022-04-15 13:11:42,021 INFO L290 TraceCheckUtils]: 46: Hoare triple {20281#false} assume 0 == ~cond; {20281#false} is VALID [2022-04-15 13:11:42,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {20281#false} ~cond := #in~cond; {20281#false} is VALID [2022-04-15 13:11:42,021 INFO L272 TraceCheckUtils]: 44: Hoare triple {20281#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {20281#false} is VALID [2022-04-15 13:11:42,021 INFO L290 TraceCheckUtils]: 43: Hoare triple {20479#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {20281#false} is VALID [2022-04-15 13:11:42,027 INFO L290 TraceCheckUtils]: 42: Hoare triple {20483#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20479#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,047 INFO L290 TraceCheckUtils]: 41: Hoare triple {20487#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20483#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {20491#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20487#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {20495#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20491#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {20499#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20495#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {20503#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20499#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {20507#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20503#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {20511#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20507#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {20515#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20511#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {20519#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20515#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {20523#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20519#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {20527#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20523#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {20531#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20527#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {20535#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20531#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {20539#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20535#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {20543#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20539#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {20547#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20543#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {20551#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20547#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {20555#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20551#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {20559#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20555#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {20563#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20559#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {20567#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20563#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {20571#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20567#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {20575#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20571#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {20579#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20575#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {20583#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20579#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {20587#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20583#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {20591#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20587#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {20595#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20591#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {20599#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20595#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {20603#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20599#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {20607#(< (mod (+ 32 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20603#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {20611#(< (mod (+ main_~z~0 33) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20607#(< (mod (+ 32 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {20615#(< (mod (+ main_~z~0 34) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20611#(< (mod (+ main_~z~0 33) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {20619#(< (mod (+ 35 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {20615#(< (mod (+ main_~z~0 34) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {20280#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {20619#(< (mod (+ 35 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:11:42,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {20280#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {20280#true} is VALID [2022-04-15 13:11:42,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {20280#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {20280#true} is VALID [2022-04-15 13:11:42,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {20280#true} call #t~ret7 := main(); {20280#true} is VALID [2022-04-15 13:11:42,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20280#true} {20280#true} #63#return; {20280#true} is VALID [2022-04-15 13:11:42,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {20280#true} assume true; {20280#true} is VALID [2022-04-15 13:11:42,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {20280#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20280#true} is VALID [2022-04-15 13:11:42,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {20280#true} call ULTIMATE.init(); {20280#true} is VALID [2022-04-15 13:11:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:11:42,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136622208] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:11:42,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:11:42,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-15 13:11:42,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:11:42,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [323282537] [2022-04-15 13:11:42,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [323282537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:42,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:42,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 13:11:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611232628] [2022-04-15 13:11:42,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:11:42,512 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 38 states have internal predecessors, (44), 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 48 [2022-04-15 13:11:42,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:11:42,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 38 states have internal predecessors, (44), 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-15 13:11:42,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:42,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 13:11:42,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:42,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 13:11:42,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1517, Invalid=4183, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 13:11:42,627 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 39 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 38 states have internal predecessors, (44), 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-15 13:12:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:16,287 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-04-15 13:12:16,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 13:12:16,287 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 38 states have internal predecessors, (44), 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 48 [2022-04-15 13:12:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:12:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 38 states have internal predecessors, (44), 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-15 13:12:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 81 transitions. [2022-04-15 13:12:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 38 states have internal predecessors, (44), 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-15 13:12:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 81 transitions. [2022-04-15 13:12:16,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 81 transitions. [2022-04-15 13:12:16,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:12:16,492 INFO L225 Difference]: With dead ends: 109 [2022-04-15 13:12:16,492 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 13:12:16,493 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 70.4s TimeCoverageRelationStatistics Valid=3027, Invalid=9405, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 13:12:16,493 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:12:16,493 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 83 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2022-04-15 13:12:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 13:12:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-15 13:12:16,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:12:16,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:12:16,539 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:12:16,539 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:12:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:16,540 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-15 13:12:16,540 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-15 13:12:16,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:12:16,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:12:16,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 59 states. [2022-04-15 13:12:16,540 INFO L87 Difference]: Start difference. First operand has 58 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 59 states. [2022-04-15 13:12:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:16,541 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-15 13:12:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-15 13:12:16,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:12:16,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:12:16,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:12:16,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:12:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:12:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-04-15 13:12:16,542 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 48 [2022-04-15 13:12:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:12:16,542 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-04-15 13:12:16,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 38 states have internal predecessors, (44), 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-15 13:12:16,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 62 transitions. [2022-04-15 13:12:16,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:12:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 13:12:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 13:12:16,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:12:16,860 INFO L499 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:12:16,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 13:12:17,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:12:17,079 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:12:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:12:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash -404100286, now seen corresponding path program 71 times [2022-04-15 13:12:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:12:17,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [587797140] [2022-04-15 13:12:17,108 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:12:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1790177923, now seen corresponding path program 1 times [2022-04-15 13:12:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:12:17,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438027598] [2022-04-15 13:12:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:12:17,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:12:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:12:17,114 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:12:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:12:17,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:12:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash -404100286, now seen corresponding path program 72 times [2022-04-15 13:12:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:12:17,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234905468] [2022-04-15 13:12:17,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:12:17,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:12:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:12:17,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:12:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:12:17,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {21213#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21171#true} is VALID [2022-04-15 13:12:17,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {21171#true} assume true; {21171#true} is VALID [2022-04-15 13:12:17,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21171#true} {21171#true} #63#return; {21171#true} is VALID [2022-04-15 13:12:17,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {21171#true} call ULTIMATE.init(); {21213#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:12:17,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {21213#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21171#true} is VALID [2022-04-15 13:12:17,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {21171#true} assume true; {21171#true} is VALID [2022-04-15 13:12:17,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21171#true} {21171#true} #63#return; {21171#true} is VALID [2022-04-15 13:12:17,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {21171#true} call #t~ret7 := main(); {21171#true} is VALID [2022-04-15 13:12:17,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {21171#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {21171#true} is VALID [2022-04-15 13:12:17,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {21171#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {21171#true} is VALID [2022-04-15 13:12:17,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {21171#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {21176#(= main_~z~0 0)} is VALID [2022-04-15 13:12:17,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {21176#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21177#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:12:17,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {21177#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21178#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:12:17,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {21178#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21179#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:12:17,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {21179#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21180#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:12:17,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {21180#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21181#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:12:17,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {21181#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21182#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:12:17,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {21182#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21183#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:12:17,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {21183#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21184#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:12:17,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {21184#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21185#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:12:17,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {21185#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21186#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:12:17,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {21186#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21187#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:12:17,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {21187#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21188#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:12:17,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {21188#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21189#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:12:17,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {21189#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21190#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:12:17,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {21190#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21191#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:12:17,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {21191#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21192#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:12:17,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {21192#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21193#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:12:17,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {21193#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21194#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:12:17,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {21194#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21195#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:12:17,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {21195#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21196#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:12:17,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {21196#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21197#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:12:17,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {21197#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21198#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:12:18,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {21198#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21199#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:12:18,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {21199#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21200#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:12:18,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {21200#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21201#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:12:18,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {21201#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21202#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:12:18,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {21202#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21203#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:12:18,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {21203#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21204#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:12:18,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {21204#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21205#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:12:18,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {21205#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21206#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:12:18,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {21206#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21207#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:12:18,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {21207#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21208#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:12:18,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {21208#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21209#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-15 13:12:18,081 INFO L290 TraceCheckUtils]: 41: Hoare triple {21209#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21210#(and (<= main_~z~0 34) (<= 34 main_~z~0))} is VALID [2022-04-15 13:12:18,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {21210#(and (<= main_~z~0 34) (<= 34 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21211#(and (<= main_~z~0 35) (<= 35 main_~z~0))} is VALID [2022-04-15 13:12:18,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {21211#(and (<= main_~z~0 35) (<= 35 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21212#(and (<= main_~z~0 36) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:12:18,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {21212#(and (<= main_~z~0 36) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {21172#false} is VALID [2022-04-15 13:12:18,099 INFO L272 TraceCheckUtils]: 45: Hoare triple {21172#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {21172#false} is VALID [2022-04-15 13:12:18,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {21172#false} ~cond := #in~cond; {21172#false} is VALID [2022-04-15 13:12:18,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {21172#false} assume 0 == ~cond; {21172#false} is VALID [2022-04-15 13:12:18,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {21172#false} assume !false; {21172#false} is VALID [2022-04-15 13:12:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:12:18,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:12:18,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234905468] [2022-04-15 13:12:18,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234905468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:12:18,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884609131] [2022-04-15 13:12:18,100 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:12:18,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:12:18,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:12:18,101 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:12:18,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 13:12:19,803 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-15 13:12:19,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:12:19,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-15 13:12:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:12:19,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:12:20,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {21171#true} call ULTIMATE.init(); {21171#true} is VALID [2022-04-15 13:12:20,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {21171#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21171#true} is VALID [2022-04-15 13:12:20,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {21171#true} assume true; {21171#true} is VALID [2022-04-15 13:12:20,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21171#true} {21171#true} #63#return; {21171#true} is VALID [2022-04-15 13:12:20,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {21171#true} call #t~ret7 := main(); {21171#true} is VALID [2022-04-15 13:12:20,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {21171#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {21171#true} is VALID [2022-04-15 13:12:20,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {21171#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {21171#true} is VALID [2022-04-15 13:12:20,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {21171#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {21176#(= main_~z~0 0)} is VALID [2022-04-15 13:12:20,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {21176#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21177#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:12:20,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {21177#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21178#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:12:20,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {21178#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21179#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:12:20,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {21179#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21180#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:12:20,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {21180#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21181#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:12:20,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {21181#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21182#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:12:20,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {21182#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21183#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:12:20,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {21183#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21184#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:12:20,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {21184#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21185#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:12:20,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {21185#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21186#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:12:20,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {21186#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21187#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:12:20,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {21187#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21188#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:12:20,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {21188#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21189#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:12:20,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {21189#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21190#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:12:20,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {21190#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21191#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:12:20,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {21191#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21192#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:12:20,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {21192#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21193#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:12:20,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {21193#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21194#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:12:20,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {21194#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21195#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:12:20,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {21195#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21196#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:12:20,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {21196#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21197#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:12:20,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {21197#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21198#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:12:20,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {21198#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21199#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:12:20,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {21199#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21200#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:12:20,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {21200#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21201#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:12:20,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {21201#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21202#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:12:20,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {21202#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21203#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:12:20,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {21203#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21204#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:12:20,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {21204#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21205#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:12:20,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {21205#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21206#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:12:20,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {21206#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21207#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:12:20,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {21207#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21208#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:12:20,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {21208#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21209#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-15 13:12:20,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {21209#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21210#(and (<= main_~z~0 34) (<= 34 main_~z~0))} is VALID [2022-04-15 13:12:20,427 INFO L290 TraceCheckUtils]: 42: Hoare triple {21210#(and (<= main_~z~0 34) (<= 34 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21211#(and (<= main_~z~0 35) (<= 35 main_~z~0))} is VALID [2022-04-15 13:12:20,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {21211#(and (<= main_~z~0 35) (<= 35 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21346#(and (<= 36 main_~z~0) (<= main_~z~0 36))} is VALID [2022-04-15 13:12:20,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {21346#(and (<= 36 main_~z~0) (<= main_~z~0 36))} assume !(~z~0 % 4294967296 < 268435455); {21172#false} is VALID [2022-04-15 13:12:20,434 INFO L272 TraceCheckUtils]: 45: Hoare triple {21172#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {21172#false} is VALID [2022-04-15 13:12:20,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {21172#false} ~cond := #in~cond; {21172#false} is VALID [2022-04-15 13:12:20,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {21172#false} assume 0 == ~cond; {21172#false} is VALID [2022-04-15 13:12:20,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {21172#false} assume !false; {21172#false} is VALID [2022-04-15 13:12:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:12:20,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:12:45,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {21172#false} assume !false; {21172#false} is VALID [2022-04-15 13:12:45,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {21365#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21172#false} is VALID [2022-04-15 13:12:45,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {21369#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21365#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:12:45,271 INFO L272 TraceCheckUtils]: 45: Hoare triple {21373#(= (mod main_~z~0 4) 0)} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {21369#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:12:45,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {21377#(or (< (mod main_~z~0 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !(~z~0 % 4294967296 < 268435455); {21373#(= (mod main_~z~0 4) 0)} is VALID [2022-04-15 13:12:45,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {21381#(or (< (mod (+ main_~z~0 1) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21377#(or (< (mod main_~z~0 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:12:45,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {21385#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 2) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21381#(or (< (mod (+ main_~z~0 1) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:12:45,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {21389#(or (< (mod (+ main_~z~0 3) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21385#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 2) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {21393#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 4) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21389#(or (< (mod (+ main_~z~0 3) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:12:45,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {21397#(or (< (mod (+ 5 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21393#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 4) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {21401#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 6) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21397#(or (< (mod (+ 5 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:12:45,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {21405#(or (< (mod (+ 7 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21401#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 6) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {21409#(or (< (mod (+ main_~z~0 8) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21405#(or (< (mod (+ 7 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:12:45,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {21413#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ main_~z~0 9) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21409#(or (< (mod (+ main_~z~0 8) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:12:45,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {21417#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 10) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21413#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ main_~z~0 9) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {21421#(or (< (mod (+ main_~z~0 11) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21417#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 10) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {21425#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 12) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21421#(or (< (mod (+ main_~z~0 11) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:12:45,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {21429#(or (< (mod (+ main_~z~0 13) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21425#(or (= (mod main_~z~0 4) 0) (< (mod (+ main_~z~0 12) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {21433#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 14) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21429#(or (< (mod (+ main_~z~0 13) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:12:45,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {21437#(or (< (mod (+ main_~z~0 15) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21433#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 14) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {21441#(or (< (mod (+ main_~z~0 16) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21437#(or (< (mod (+ main_~z~0 15) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:12:45,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {21445#(or (< (mod (+ main_~z~0 17) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21441#(or (< (mod (+ main_~z~0 16) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:12:45,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {21449#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 18) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21445#(or (< (mod (+ main_~z~0 17) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:12:45,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {21453#(or (< (mod (+ 19 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21449#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 18) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {21457#(or (< (mod (+ main_~z~0 20) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21453#(or (< (mod (+ 19 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:12:45,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {21461#(or (< (mod (+ main_~z~0 21) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21457#(or (< (mod (+ main_~z~0 20) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:12:45,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {21465#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 22) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21461#(or (< (mod (+ main_~z~0 21) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:12:45,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {21469#(or (< (mod (+ 23 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21465#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 22) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {21473#(or (< (mod (+ main_~z~0 24) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21469#(or (< (mod (+ 23 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:12:45,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {21477#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ main_~z~0 25) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21473#(or (< (mod (+ main_~z~0 24) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:12:45,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {21481#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 26) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21477#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ main_~z~0 25) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {21485#(or (< (mod (+ main_~z~0 27) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21481#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 26) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {21489#(or (< (mod (+ main_~z~0 28) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21485#(or (< (mod (+ main_~z~0 27) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:12:45,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {21493#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ 29 main_~z~0) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21489#(or (< (mod (+ main_~z~0 28) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:12:45,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {21497#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ 30 main_~z~0) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21493#(or (= (mod (+ main_~z~0 1) 4) 0) (< (mod (+ 29 main_~z~0) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {21501#(or (< (mod (+ main_~z~0 31) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21497#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ 30 main_~z~0) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {21505#(or (< (mod (+ 32 main_~z~0) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21501#(or (< (mod (+ main_~z~0 31) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:12:45,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {21509#(or (< (mod (+ main_~z~0 33) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21505#(or (< (mod (+ 32 main_~z~0) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:12:45,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {21513#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 34) 4294967296) 268435455))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21509#(or (< (mod (+ main_~z~0 33) 4294967296) 268435455) (= (mod (+ main_~z~0 1) 4) 0))} is VALID [2022-04-15 13:12:45,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {21517#(or (< (mod (+ 35 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21513#(or (= (mod (+ main_~z~0 2) 4) 0) (< (mod (+ main_~z~0 34) 4294967296) 268435455))} is VALID [2022-04-15 13:12:45,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {21521#(or (< (mod (+ main_~z~0 36) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {21517#(or (< (mod (+ 35 main_~z~0) 4294967296) 268435455) (= (mod (+ main_~z~0 3) 4) 0))} is VALID [2022-04-15 13:12:45,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {21171#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {21521#(or (< (mod (+ main_~z~0 36) 4294967296) 268435455) (= (mod main_~z~0 4) 0))} is VALID [2022-04-15 13:12:45,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {21171#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {21171#true} is VALID [2022-04-15 13:12:45,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {21171#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {21171#true} is VALID [2022-04-15 13:12:45,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {21171#true} call #t~ret7 := main(); {21171#true} is VALID [2022-04-15 13:12:45,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21171#true} {21171#true} #63#return; {21171#true} is VALID [2022-04-15 13:12:45,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {21171#true} assume true; {21171#true} is VALID [2022-04-15 13:12:45,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {21171#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21171#true} is VALID [2022-04-15 13:12:45,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {21171#true} call ULTIMATE.init(); {21171#true} is VALID [2022-04-15 13:12:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:12:45,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884609131] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:12:45,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:12:45,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 42] total 81 [2022-04-15 13:12:45,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:12:45,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [587797140] [2022-04-15 13:12:45,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [587797140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:12:45,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:12:45,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 13:12:45,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137417679] [2022-04-15 13:12:45,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:12:45,658 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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 49 [2022-04-15 13:12:45,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:12:45,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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-15 13:12:45,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:12:45,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 13:12:45,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:12:45,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 13:12:45,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=4858, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 13:12:45,778 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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-15 13:13:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:30,049 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-04-15 13:13:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 13:13:30,049 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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 49 [2022-04-15 13:13:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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-15 13:13:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2022-04-15 13:13:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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-15 13:13:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2022-04-15 13:13:30,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 82 transitions. [2022-04-15 13:13:30,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:30,236 INFO L225 Difference]: With dead ends: 111 [2022-04-15 13:13:30,236 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 13:13:30,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=3220, Invalid=10586, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 13:13:30,237 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:30,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 83 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 17.7s Time] [2022-04-15 13:13:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 13:13:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-15 13:13:30,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:30,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:13:30,280 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:13:30,281 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:13:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:30,281 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 13:13:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-15 13:13:30,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:30,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:30,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 60 states. [2022-04-15 13:13:30,282 INFO L87 Difference]: Start difference. First operand has 59 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 60 states. [2022-04-15 13:13:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:30,282 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 13:13:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-15 13:13:30,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:30,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:30,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:30,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:13:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-15 13:13:30,283 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 49 [2022-04-15 13:13:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:30,283 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-15 13:13:30,284 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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-15 13:13:30,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2022-04-15 13:13:30,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-15 13:13:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 13:13:30,552 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:30,552 INFO L499 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:30,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-04-15 13:13:30,752 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:13:30,752 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:30,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash 384095586, now seen corresponding path program 73 times [2022-04-15 13:13:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:30,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [839411263] [2022-04-15 13:13:30,782 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:13:30,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1849283267, now seen corresponding path program 1 times [2022-04-15 13:13:30,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:30,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307783412] [2022-04-15 13:13:30,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:30,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:13:30,787 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:13:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:13:30,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:13:30,790 INFO L85 PathProgramCache]: Analyzing trace with hash 384095586, now seen corresponding path program 74 times [2022-04-15 13:13:30,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:30,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845758248] [2022-04-15 13:13:30,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:30,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:31,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:13:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:31,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {22126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22083#true} is VALID [2022-04-15 13:13:31,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {22083#true} assume true; {22083#true} is VALID [2022-04-15 13:13:31,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22083#true} {22083#true} #63#return; {22083#true} is VALID [2022-04-15 13:13:31,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {22083#true} call ULTIMATE.init(); {22126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:13:31,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {22126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22083#true} is VALID [2022-04-15 13:13:31,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {22083#true} assume true; {22083#true} is VALID [2022-04-15 13:13:31,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22083#true} {22083#true} #63#return; {22083#true} is VALID [2022-04-15 13:13:31,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {22083#true} call #t~ret7 := main(); {22083#true} is VALID [2022-04-15 13:13:31,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {22083#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {22083#true} is VALID [2022-04-15 13:13:31,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {22083#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {22083#true} is VALID [2022-04-15 13:13:31,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {22083#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {22088#(= main_~z~0 0)} is VALID [2022-04-15 13:13:31,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {22088#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22089#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:13:31,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {22089#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22090#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:13:31,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {22090#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22091#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:13:31,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {22091#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22092#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:13:31,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {22092#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22093#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:13:31,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {22093#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22094#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:13:31,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {22094#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22095#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:13:31,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {22095#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22096#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:13:31,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {22096#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22097#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:13:31,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {22097#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22098#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:13:31,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {22098#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22099#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:13:31,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {22099#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22100#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:13:31,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {22100#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22101#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:13:31,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {22101#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22102#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:13:31,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {22102#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22103#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:13:31,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {22103#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22104#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:13:31,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {22104#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22105#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:13:31,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {22105#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22106#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:13:31,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {22106#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22107#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:13:31,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {22107#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22108#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:13:31,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {22108#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22109#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:13:31,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {22109#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22110#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:13:31,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {22110#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22111#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:13:31,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {22111#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22112#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:13:31,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {22112#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22113#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:13:31,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {22113#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22114#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:13:31,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {22114#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22115#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:13:31,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {22115#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22116#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:13:31,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {22116#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22117#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:13:31,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {22117#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22118#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:13:31,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {22118#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22119#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:13:31,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {22119#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22120#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:13:31,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {22120#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22121#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-15 13:13:31,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {22121#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22122#(and (<= main_~z~0 34) (<= 34 main_~z~0))} is VALID [2022-04-15 13:13:31,826 INFO L290 TraceCheckUtils]: 42: Hoare triple {22122#(and (<= main_~z~0 34) (<= 34 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22123#(and (<= main_~z~0 35) (<= 35 main_~z~0))} is VALID [2022-04-15 13:13:31,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {22123#(and (<= main_~z~0 35) (<= 35 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22124#(and (<= 36 main_~z~0) (<= main_~z~0 36))} is VALID [2022-04-15 13:13:31,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {22124#(and (<= 36 main_~z~0) (<= main_~z~0 36))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22125#(and (<= main_~z~0 37) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:13:31,834 INFO L290 TraceCheckUtils]: 45: Hoare triple {22125#(and (<= main_~z~0 37) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {22084#false} is VALID [2022-04-15 13:13:31,834 INFO L272 TraceCheckUtils]: 46: Hoare triple {22084#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {22084#false} is VALID [2022-04-15 13:13:31,834 INFO L290 TraceCheckUtils]: 47: Hoare triple {22084#false} ~cond := #in~cond; {22084#false} is VALID [2022-04-15 13:13:31,834 INFO L290 TraceCheckUtils]: 48: Hoare triple {22084#false} assume 0 == ~cond; {22084#false} is VALID [2022-04-15 13:13:31,834 INFO L290 TraceCheckUtils]: 49: Hoare triple {22084#false} assume !false; {22084#false} is VALID [2022-04-15 13:13:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:13:31,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:31,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845758248] [2022-04-15 13:13:31,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845758248] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:13:31,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818577601] [2022-04-15 13:13:31,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:13:31,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:13:31,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:13:31,836 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:13:31,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 13:13:31,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:13:31,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:13:31,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 77 conjunts are in the unsatisfiable core [2022-04-15 13:13:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:31,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:13:32,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {22083#true} call ULTIMATE.init(); {22083#true} is VALID [2022-04-15 13:13:32,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {22083#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22083#true} is VALID [2022-04-15 13:13:32,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {22083#true} assume true; {22083#true} is VALID [2022-04-15 13:13:32,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22083#true} {22083#true} #63#return; {22083#true} is VALID [2022-04-15 13:13:32,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {22083#true} call #t~ret7 := main(); {22083#true} is VALID [2022-04-15 13:13:32,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {22083#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {22083#true} is VALID [2022-04-15 13:13:32,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {22083#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {22083#true} is VALID [2022-04-15 13:13:32,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {22083#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {22088#(= main_~z~0 0)} is VALID [2022-04-15 13:13:32,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {22088#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22089#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:13:32,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {22089#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22090#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:13:32,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {22090#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22091#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:13:32,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {22091#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22092#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:13:32,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {22092#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22093#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:13:32,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {22093#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22094#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:13:32,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {22094#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22095#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:13:32,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {22095#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22096#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:13:32,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {22096#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22097#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:13:32,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {22097#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22098#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:13:32,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {22098#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22099#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:13:32,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {22099#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22100#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:13:32,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {22100#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22101#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:13:32,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {22101#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22102#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:13:32,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {22102#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22103#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:13:32,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {22103#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22104#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:13:32,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {22104#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22105#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:13:32,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {22105#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22106#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:13:32,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {22106#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22107#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:13:32,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {22107#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22108#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:13:32,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {22108#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22109#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:13:32,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {22109#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22110#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:13:32,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {22110#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22111#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:13:32,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {22111#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22112#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:13:32,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {22112#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22113#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:13:32,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {22113#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22114#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:13:32,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {22114#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22115#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:13:32,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {22115#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22116#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:13:32,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {22116#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22117#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:13:32,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {22117#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22118#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:13:32,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {22118#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22119#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:13:32,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {22119#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22120#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:13:32,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {22120#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22121#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-15 13:13:32,524 INFO L290 TraceCheckUtils]: 41: Hoare triple {22121#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22122#(and (<= main_~z~0 34) (<= 34 main_~z~0))} is VALID [2022-04-15 13:13:32,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {22122#(and (<= main_~z~0 34) (<= 34 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22123#(and (<= main_~z~0 35) (<= 35 main_~z~0))} is VALID [2022-04-15 13:13:32,536 INFO L290 TraceCheckUtils]: 43: Hoare triple {22123#(and (<= main_~z~0 35) (<= 35 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22124#(and (<= 36 main_~z~0) (<= main_~z~0 36))} is VALID [2022-04-15 13:13:32,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {22124#(and (<= 36 main_~z~0) (<= main_~z~0 36))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22262#(and (<= 37 main_~z~0) (<= main_~z~0 37))} is VALID [2022-04-15 13:13:32,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {22262#(and (<= 37 main_~z~0) (<= main_~z~0 37))} assume !(~z~0 % 4294967296 < 268435455); {22084#false} is VALID [2022-04-15 13:13:32,553 INFO L272 TraceCheckUtils]: 46: Hoare triple {22084#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {22084#false} is VALID [2022-04-15 13:13:32,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {22084#false} ~cond := #in~cond; {22084#false} is VALID [2022-04-15 13:13:32,553 INFO L290 TraceCheckUtils]: 48: Hoare triple {22084#false} assume 0 == ~cond; {22084#false} is VALID [2022-04-15 13:13:32,554 INFO L290 TraceCheckUtils]: 49: Hoare triple {22084#false} assume !false; {22084#false} is VALID [2022-04-15 13:13:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:13:32,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:14:32,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {22084#false} assume !false; {22084#false} is VALID [2022-04-15 13:14:32,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {22084#false} assume 0 == ~cond; {22084#false} is VALID [2022-04-15 13:14:32,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {22084#false} ~cond := #in~cond; {22084#false} is VALID [2022-04-15 13:14:32,504 INFO L272 TraceCheckUtils]: 46: Hoare triple {22084#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {22084#false} is VALID [2022-04-15 13:14:32,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {22290#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {22084#false} is VALID [2022-04-15 13:14:32,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {22294#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22290#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,529 INFO L290 TraceCheckUtils]: 43: Hoare triple {22298#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22294#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {22302#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22298#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {22306#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22302#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,545 INFO L290 TraceCheckUtils]: 40: Hoare triple {22310#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22306#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {22314#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22310#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {22318#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22314#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {22322#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22318#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {22326#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22322#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {22330#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22326#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {22334#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22330#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {22338#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22334#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {22342#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22338#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {22346#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22342#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {22350#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22346#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {22354#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22350#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {22358#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22354#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {22362#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22358#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {22366#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22362#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {22370#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22366#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {22374#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22370#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {22378#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22374#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {22382#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22378#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {22386#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22382#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {22390#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22386#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {22394#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22390#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {22398#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22394#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {22402#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22398#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {22406#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22402#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {22410#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22406#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {22414#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22410#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {22418#(< (mod (+ 32 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22414#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {22422#(< (mod (+ main_~z~0 33) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22418#(< (mod (+ 32 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {22426#(< (mod (+ main_~z~0 34) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22422#(< (mod (+ main_~z~0 33) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {22430#(< (mod (+ 35 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22426#(< (mod (+ main_~z~0 34) 4294967296) 268435455)} is VALID [2022-04-15 13:14:32,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {22434#(< (mod (+ main_~z~0 36) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22430#(< (mod (+ 35 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:14:33,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {22438#(< (mod (+ main_~z~0 37) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {22434#(< (mod (+ main_~z~0 36) 4294967296) 268435455)} is VALID [2022-04-15 13:14:33,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {22083#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {22438#(< (mod (+ main_~z~0 37) 4294967296) 268435455)} is VALID [2022-04-15 13:14:33,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {22083#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {22083#true} is VALID [2022-04-15 13:14:33,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {22083#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {22083#true} is VALID [2022-04-15 13:14:33,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {22083#true} call #t~ret7 := main(); {22083#true} is VALID [2022-04-15 13:14:33,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22083#true} {22083#true} #63#return; {22083#true} is VALID [2022-04-15 13:14:33,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {22083#true} assume true; {22083#true} is VALID [2022-04-15 13:14:33,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {22083#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22083#true} is VALID [2022-04-15 13:14:33,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {22083#true} call ULTIMATE.init(); {22083#true} is VALID [2022-04-15 13:14:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:14:33,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818577601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:14:33,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:14:33,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-15 13:14:33,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:33,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [839411263] [2022-04-15 13:14:33,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [839411263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:33,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:33,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 13:14:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039900859] [2022-04-15 13:14:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:33,012 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 40 states have internal predecessors, (46), 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 50 [2022-04-15 13:14:33,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:33,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 40 states have internal predecessors, (46), 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-15 13:14:33,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:33,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 13:14:33,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:33,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 13:14:33,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1677, Invalid=4643, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 13:14:33,122 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 40 states have internal predecessors, (46), 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-15 13:15:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:17,480 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-04-15 13:15:17,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 13:15:17,480 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 40 states have internal predecessors, (46), 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 50 [2022-04-15 13:15:17,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:15:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 40 states have internal predecessors, (46), 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-15 13:15:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 83 transitions. [2022-04-15 13:15:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 40 states have internal predecessors, (46), 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-15 13:15:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 83 transitions. [2022-04-15 13:15:17,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 83 transitions. [2022-04-15 13:15:17,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:17,695 INFO L225 Difference]: With dead ends: 113 [2022-04-15 13:15:17,695 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 13:15:17,696 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 60.3s TimeCoverageRelationStatistics Valid=3347, Invalid=10459, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 13:15:17,696 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:15:17,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 163 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 17.5s Time] [2022-04-15 13:15:17,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 13:15:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-15 13:15:17,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:15:17,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 60 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:15:17,747 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 60 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:15:17,747 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 60 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:15:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:17,748 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-15 13:15:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-15 13:15:17,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:17,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:17,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 61 states. [2022-04-15 13:15:17,749 INFO L87 Difference]: Start difference. First operand has 60 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 61 states. [2022-04-15 13:15:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:17,749 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-15 13:15:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-15 13:15:17,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:17,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:17,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:15:17,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:15:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:15:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-04-15 13:15:17,750 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 50 [2022-04-15 13:15:17,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:15:17,750 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-04-15 13:15:17,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 40 states have internal predecessors, (46), 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-15 13:15:17,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 64 transitions. [2022-04-15 13:15:18,087 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-15 13:15:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-15 13:15:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 13:15:18,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:15:18,088 INFO L499 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:15:18,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-15 13:15:18,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-04-15 13:15:18,303 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:15:18,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:15:18,304 INFO L85 PathProgramCache]: Analyzing trace with hash -951636158, now seen corresponding path program 75 times [2022-04-15 13:15:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:18,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1283673422] [2022-04-15 13:15:18,333 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:15:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1908388611, now seen corresponding path program 1 times [2022-04-15 13:15:18,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:15:18,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038548730] [2022-04-15 13:15:18,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:15:18,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:15:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:15:18,339 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:15:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:15:18,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:15:18,342 INFO L85 PathProgramCache]: Analyzing trace with hash -951636158, now seen corresponding path program 76 times [2022-04-15 13:15:18,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:15:18,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591742950] [2022-04-15 13:15:18,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:15:18,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:15:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:19,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:15:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:19,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {23054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23010#true} is VALID [2022-04-15 13:15:19,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {23010#true} assume true; {23010#true} is VALID [2022-04-15 13:15:19,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23010#true} {23010#true} #63#return; {23010#true} is VALID [2022-04-15 13:15:19,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {23010#true} call ULTIMATE.init(); {23054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:15:19,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {23054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23010#true} is VALID [2022-04-15 13:15:19,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {23010#true} assume true; {23010#true} is VALID [2022-04-15 13:15:19,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23010#true} {23010#true} #63#return; {23010#true} is VALID [2022-04-15 13:15:19,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {23010#true} call #t~ret7 := main(); {23010#true} is VALID [2022-04-15 13:15:19,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {23010#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {23010#true} is VALID [2022-04-15 13:15:19,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {23010#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {23010#true} is VALID [2022-04-15 13:15:19,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {23010#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {23015#(= main_~z~0 0)} is VALID [2022-04-15 13:15:19,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {23015#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23016#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:15:19,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {23016#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23017#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:15:19,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {23017#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23018#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:15:19,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {23018#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23019#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:15:19,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {23019#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23020#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:15:19,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {23020#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23021#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:15:19,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {23021#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23022#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:15:19,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {23022#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23023#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:15:19,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {23023#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23024#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:15:19,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {23024#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23025#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:15:19,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {23025#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23026#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:15:19,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {23026#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23027#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:15:19,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {23027#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23028#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:15:19,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {23028#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:15:19,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {23029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23030#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:15:19,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {23030#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23031#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:15:19,282 INFO L290 TraceCheckUtils]: 24: Hoare triple {23031#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23032#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:15:19,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {23032#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23033#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:15:19,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {23033#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23034#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:15:19,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {23034#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23035#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:15:19,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {23035#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23036#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:15:19,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {23036#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23037#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:15:19,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {23037#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23038#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:15:19,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {23038#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23039#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:15:19,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {23039#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23040#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:15:19,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {23040#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23041#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:15:19,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {23041#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23042#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:15:19,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {23042#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23043#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:15:19,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {23043#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23044#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:15:19,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {23044#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23045#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:15:19,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {23045#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23046#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:15:19,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {23046#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23047#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:15:19,414 INFO L290 TraceCheckUtils]: 40: Hoare triple {23047#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23048#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-15 13:15:19,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {23048#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23049#(and (<= main_~z~0 34) (<= 34 main_~z~0))} is VALID [2022-04-15 13:15:19,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {23049#(and (<= main_~z~0 34) (<= 34 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23050#(and (<= main_~z~0 35) (<= 35 main_~z~0))} is VALID [2022-04-15 13:15:19,453 INFO L290 TraceCheckUtils]: 43: Hoare triple {23050#(and (<= main_~z~0 35) (<= 35 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23051#(and (<= 36 main_~z~0) (<= main_~z~0 36))} is VALID [2022-04-15 13:15:19,474 INFO L290 TraceCheckUtils]: 44: Hoare triple {23051#(and (<= 36 main_~z~0) (<= main_~z~0 36))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23052#(and (<= 37 main_~z~0) (<= main_~z~0 37))} is VALID [2022-04-15 13:15:19,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {23052#(and (<= 37 main_~z~0) (<= main_~z~0 37))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23053#(and (<= main_~z~0 38) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:15:19,494 INFO L290 TraceCheckUtils]: 46: Hoare triple {23053#(and (<= main_~z~0 38) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {23011#false} is VALID [2022-04-15 13:15:19,494 INFO L272 TraceCheckUtils]: 47: Hoare triple {23011#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {23011#false} is VALID [2022-04-15 13:15:19,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {23011#false} ~cond := #in~cond; {23011#false} is VALID [2022-04-15 13:15:19,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {23011#false} assume 0 == ~cond; {23011#false} is VALID [2022-04-15 13:15:19,494 INFO L290 TraceCheckUtils]: 50: Hoare triple {23011#false} assume !false; {23011#false} is VALID [2022-04-15 13:15:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:15:19,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:15:19,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591742950] [2022-04-15 13:15:19,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591742950] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:15:19,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300609400] [2022-04-15 13:15:19,495 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:15:19,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:15:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:15:19,496 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:15:19,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 13:15:19,618 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:15:19,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:15:19,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-15 13:15:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:19,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:15:20,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {23010#true} call ULTIMATE.init(); {23010#true} is VALID [2022-04-15 13:15:20,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {23010#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23010#true} is VALID [2022-04-15 13:15:20,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {23010#true} assume true; {23010#true} is VALID [2022-04-15 13:15:20,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23010#true} {23010#true} #63#return; {23010#true} is VALID [2022-04-15 13:15:20,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {23010#true} call #t~ret7 := main(); {23010#true} is VALID [2022-04-15 13:15:20,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {23010#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {23010#true} is VALID [2022-04-15 13:15:20,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {23010#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {23010#true} is VALID [2022-04-15 13:15:20,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {23010#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {23015#(= main_~z~0 0)} is VALID [2022-04-15 13:15:20,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {23015#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23016#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:15:20,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {23016#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23017#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:15:20,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {23017#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23018#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:15:20,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {23018#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23019#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:15:20,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {23019#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23020#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:15:20,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {23020#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23021#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:15:20,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {23021#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23022#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:15:20,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {23022#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23023#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:15:20,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {23023#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23024#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:15:20,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {23024#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23025#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:15:20,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {23025#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23026#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:15:20,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {23026#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23027#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:15:20,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {23027#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23028#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:15:20,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {23028#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:15:20,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {23029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23030#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:15:20,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {23030#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23031#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:15:20,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {23031#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23032#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:15:20,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {23032#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23033#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:15:20,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {23033#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23034#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:15:20,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {23034#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23035#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:15:20,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {23035#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23036#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:15:20,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {23036#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23037#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:15:20,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {23037#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23038#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:15:20,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {23038#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23039#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:15:20,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {23039#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23040#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:15:20,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {23040#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23041#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:15:20,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {23041#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23042#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:15:20,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {23042#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23043#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:15:20,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {23043#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23044#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:15:20,286 INFO L290 TraceCheckUtils]: 37: Hoare triple {23044#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23045#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:15:20,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {23045#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23046#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:15:20,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {23046#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23047#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:15:20,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {23047#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23048#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-15 13:15:20,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {23048#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23049#(and (<= main_~z~0 34) (<= 34 main_~z~0))} is VALID [2022-04-15 13:15:20,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {23049#(and (<= main_~z~0 34) (<= 34 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23050#(and (<= main_~z~0 35) (<= 35 main_~z~0))} is VALID [2022-04-15 13:15:20,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {23050#(and (<= main_~z~0 35) (<= 35 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23051#(and (<= 36 main_~z~0) (<= main_~z~0 36))} is VALID [2022-04-15 13:15:20,341 INFO L290 TraceCheckUtils]: 44: Hoare triple {23051#(and (<= 36 main_~z~0) (<= main_~z~0 36))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23052#(and (<= 37 main_~z~0) (<= main_~z~0 37))} is VALID [2022-04-15 13:15:20,352 INFO L290 TraceCheckUtils]: 45: Hoare triple {23052#(and (<= 37 main_~z~0) (<= main_~z~0 37))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23193#(and (<= main_~z~0 38) (<= 38 main_~z~0))} is VALID [2022-04-15 13:15:20,356 INFO L290 TraceCheckUtils]: 46: Hoare triple {23193#(and (<= main_~z~0 38) (<= 38 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {23011#false} is VALID [2022-04-15 13:15:20,356 INFO L272 TraceCheckUtils]: 47: Hoare triple {23011#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {23011#false} is VALID [2022-04-15 13:15:20,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {23011#false} ~cond := #in~cond; {23011#false} is VALID [2022-04-15 13:15:20,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {23011#false} assume 0 == ~cond; {23011#false} is VALID [2022-04-15 13:15:20,356 INFO L290 TraceCheckUtils]: 50: Hoare triple {23011#false} assume !false; {23011#false} is VALID [2022-04-15 13:15:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:15:20,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:16:19,078 INFO L290 TraceCheckUtils]: 50: Hoare triple {23011#false} assume !false; {23011#false} is VALID [2022-04-15 13:16:19,078 INFO L290 TraceCheckUtils]: 49: Hoare triple {23011#false} assume 0 == ~cond; {23011#false} is VALID [2022-04-15 13:16:19,078 INFO L290 TraceCheckUtils]: 48: Hoare triple {23011#false} ~cond := #in~cond; {23011#false} is VALID [2022-04-15 13:16:19,078 INFO L272 TraceCheckUtils]: 47: Hoare triple {23011#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {23011#false} is VALID [2022-04-15 13:16:19,079 INFO L290 TraceCheckUtils]: 46: Hoare triple {23221#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {23011#false} is VALID [2022-04-15 13:16:19,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {23225#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23221#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {23229#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23225#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,111 INFO L290 TraceCheckUtils]: 43: Hoare triple {23233#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23229#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {23237#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23233#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {23241#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23237#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {23245#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23241#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,141 INFO L290 TraceCheckUtils]: 39: Hoare triple {23249#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23245#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {23253#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23249#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {23257#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23253#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {23261#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23257#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {23265#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23261#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {23269#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23265#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {23273#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23269#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {23277#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23273#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {23281#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23277#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {23285#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23281#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {23289#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23285#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {23293#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23289#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {23297#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23293#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {23301#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23297#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {23305#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23301#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {23309#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23305#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {23313#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23309#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {23317#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23313#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {23321#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23317#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {23325#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23321#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {23329#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23325#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {23333#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23329#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {23337#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23333#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {23341#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23337#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {23345#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23341#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {23349#(< (mod (+ 32 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23345#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {23353#(< (mod (+ main_~z~0 33) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23349#(< (mod (+ 32 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {23357#(< (mod (+ main_~z~0 34) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23353#(< (mod (+ main_~z~0 33) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {23361#(< (mod (+ 35 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23357#(< (mod (+ main_~z~0 34) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {23365#(< (mod (+ main_~z~0 36) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23361#(< (mod (+ 35 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {23369#(< (mod (+ main_~z~0 37) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23365#(< (mod (+ main_~z~0 36) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {23373#(< (mod (+ main_~z~0 38) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23369#(< (mod (+ main_~z~0 37) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {23010#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {23373#(< (mod (+ main_~z~0 38) 4294967296) 268435455)} is VALID [2022-04-15 13:16:19,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {23010#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {23010#true} is VALID [2022-04-15 13:16:19,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {23010#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {23010#true} is VALID [2022-04-15 13:16:19,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {23010#true} call #t~ret7 := main(); {23010#true} is VALID [2022-04-15 13:16:19,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23010#true} {23010#true} #63#return; {23010#true} is VALID [2022-04-15 13:16:19,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {23010#true} assume true; {23010#true} is VALID [2022-04-15 13:16:19,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {23010#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23010#true} is VALID [2022-04-15 13:16:19,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {23010#true} call ULTIMATE.init(); {23010#true} is VALID [2022-04-15 13:16:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:19,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300609400] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:16:19,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:16:19,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 82 [2022-04-15 13:16:19,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:19,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1283673422] [2022-04-15 13:16:19,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1283673422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:19,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:19,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 13:16:19,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055592783] [2022-04-15 13:16:19,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:19,546 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.119047619047619) internal successors, (47), 41 states have internal predecessors, (47), 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 51 [2022-04-15 13:16:19,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:19,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.119047619047619) internal successors, (47), 41 states have internal predecessors, (47), 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-15 13:16:19,649 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-15 13:16:19,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 13:16:19,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:19,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 13:16:19,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1760, Invalid=4882, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 13:16:19,650 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 42 states, 42 states have (on average 1.119047619047619) internal successors, (47), 41 states have internal predecessors, (47), 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-15 13:16:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:58,803 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2022-04-15 13:16:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 13:16:58,803 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.119047619047619) internal successors, (47), 41 states have internal predecessors, (47), 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 51 [2022-04-15 13:16:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.119047619047619) internal successors, (47), 41 states have internal predecessors, (47), 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-15 13:16:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 84 transitions. [2022-04-15 13:16:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.119047619047619) internal successors, (47), 41 states have internal predecessors, (47), 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-15 13:16:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 84 transitions. [2022-04-15 13:16:58,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 84 transitions. [2022-04-15 13:16:59,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:59,030 INFO L225 Difference]: With dead ends: 115 [2022-04-15 13:16:59,030 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 13:16:59,031 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 59.0s TimeCoverageRelationStatistics Valid=3513, Invalid=11007, Unknown=0, NotChecked=0, Total=14520 [2022-04-15 13:16:59,031 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:59,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 138 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2022-04-15 13:16:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 13:16:59,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-04-15 13:16:59,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:59,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 61 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 54 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:16:59,083 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 61 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 54 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:16:59,083 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 61 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 54 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:16:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:59,084 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-04-15 13:16:59,084 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-15 13:16:59,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:59,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:59,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 54 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 62 states. [2022-04-15 13:16:59,084 INFO L87 Difference]: Start difference. First operand has 61 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 54 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 62 states. [2022-04-15 13:16:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:59,085 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-04-15 13:16:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-15 13:16:59,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:59,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:59,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:59,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 54 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:16:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-04-15 13:16:59,086 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 51 [2022-04-15 13:16:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:59,086 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-04-15 13:16:59,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.119047619047619) internal successors, (47), 41 states have internal predecessors, (47), 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-15 13:16:59,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 65 transitions. [2022-04-15 13:16:59,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-15 13:16:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 13:16:59,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:59,493 INFO L499 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:59,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-15 13:16:59,694 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78,SelfDestructingSolverStorable79 [2022-04-15 13:16:59,694 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:59,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash 590352738, now seen corresponding path program 77 times [2022-04-15 13:16:59,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:59,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1168501597] [2022-04-15 13:16:59,723 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:16:59,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1967493955, now seen corresponding path program 1 times [2022-04-15 13:16:59,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:59,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355300081] [2022-04-15 13:16:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:59,729 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:16:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:59,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:16:59,732 INFO L85 PathProgramCache]: Analyzing trace with hash 590352738, now seen corresponding path program 78 times [2022-04-15 13:16:59,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:59,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569838461] [2022-04-15 13:16:59,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:59,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:00,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:00,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {24000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23955#true} is VALID [2022-04-15 13:17:00,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {23955#true} assume true; {23955#true} is VALID [2022-04-15 13:17:00,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23955#true} {23955#true} #63#return; {23955#true} is VALID [2022-04-15 13:17:00,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {23955#true} call ULTIMATE.init(); {24000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:00,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {24000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23955#true} is VALID [2022-04-15 13:17:00,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {23955#true} assume true; {23955#true} is VALID [2022-04-15 13:17:00,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23955#true} {23955#true} #63#return; {23955#true} is VALID [2022-04-15 13:17:00,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {23955#true} call #t~ret7 := main(); {23955#true} is VALID [2022-04-15 13:17:00,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {23955#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {23955#true} is VALID [2022-04-15 13:17:00,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {23955#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {23955#true} is VALID [2022-04-15 13:17:00,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {23955#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {23960#(= main_~z~0 0)} is VALID [2022-04-15 13:17:00,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {23960#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23961#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:17:00,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {23961#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23962#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:17:00,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {23962#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23963#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:17:00,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {23963#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23964#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:17:00,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {23964#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23965#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:17:00,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {23965#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23966#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:17:00,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {23966#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23967#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:17:00,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {23967#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23968#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:17:00,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {23968#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23969#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:17:00,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {23969#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23970#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:17:00,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {23970#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23971#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:17:00,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {23971#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23972#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:17:00,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {23972#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23973#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:17:00,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {23973#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23974#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:17:00,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {23974#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23975#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:17:00,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {23975#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23976#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:17:00,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {23976#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23977#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:17:00,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {23977#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23978#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:17:00,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {23978#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23979#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:17:00,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {23979#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23980#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:17:00,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {23980#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23981#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:17:00,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {23981#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23982#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:17:00,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {23982#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23983#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:17:00,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {23983#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23984#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:17:00,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {23984#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23985#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:17:00,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {23985#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23986#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:17:00,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {23986#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23987#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:17:00,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {23987#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23988#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:17:00,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {23988#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23989#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:17:00,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {23989#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23990#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:17:00,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {23990#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23991#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:17:00,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {23991#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23992#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:17:00,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {23992#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23993#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-15 13:17:01,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {23993#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23994#(and (<= main_~z~0 34) (<= 34 main_~z~0))} is VALID [2022-04-15 13:17:01,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {23994#(and (<= main_~z~0 34) (<= 34 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23995#(and (<= main_~z~0 35) (<= 35 main_~z~0))} is VALID [2022-04-15 13:17:01,034 INFO L290 TraceCheckUtils]: 43: Hoare triple {23995#(and (<= main_~z~0 35) (<= 35 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23996#(and (<= 36 main_~z~0) (<= main_~z~0 36))} is VALID [2022-04-15 13:17:01,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {23996#(and (<= 36 main_~z~0) (<= main_~z~0 36))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23997#(and (<= 37 main_~z~0) (<= main_~z~0 37))} is VALID [2022-04-15 13:17:01,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {23997#(and (<= 37 main_~z~0) (<= main_~z~0 37))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23998#(and (<= main_~z~0 38) (<= 38 main_~z~0))} is VALID [2022-04-15 13:17:01,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {23998#(and (<= main_~z~0 38) (<= 38 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23999#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 39))} is VALID [2022-04-15 13:17:01,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {23999#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 39))} assume !(~z~0 % 4294967296 < 268435455); {23956#false} is VALID [2022-04-15 13:17:01,106 INFO L272 TraceCheckUtils]: 48: Hoare triple {23956#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {23956#false} is VALID [2022-04-15 13:17:01,106 INFO L290 TraceCheckUtils]: 49: Hoare triple {23956#false} ~cond := #in~cond; {23956#false} is VALID [2022-04-15 13:17:01,106 INFO L290 TraceCheckUtils]: 50: Hoare triple {23956#false} assume 0 == ~cond; {23956#false} is VALID [2022-04-15 13:17:01,106 INFO L290 TraceCheckUtils]: 51: Hoare triple {23956#false} assume !false; {23956#false} is VALID [2022-04-15 13:17:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:01,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:01,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569838461] [2022-04-15 13:17:01,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569838461] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:17:01,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104522089] [2022-04-15 13:17:01,107 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:17:01,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:01,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:01,108 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:17:01,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 13:17:06,342 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-04-15 13:17:06,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:17:06,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 81 conjunts are in the unsatisfiable core [2022-04-15 13:17:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:06,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:06,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {23955#true} call ULTIMATE.init(); {23955#true} is VALID [2022-04-15 13:17:06,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {23955#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23955#true} is VALID [2022-04-15 13:17:06,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {23955#true} assume true; {23955#true} is VALID [2022-04-15 13:17:06,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23955#true} {23955#true} #63#return; {23955#true} is VALID [2022-04-15 13:17:06,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {23955#true} call #t~ret7 := main(); {23955#true} is VALID [2022-04-15 13:17:06,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {23955#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {23955#true} is VALID [2022-04-15 13:17:06,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {23955#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {23955#true} is VALID [2022-04-15 13:17:06,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {23955#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {23960#(= main_~z~0 0)} is VALID [2022-04-15 13:17:06,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {23960#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23961#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 13:17:06,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {23961#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23962#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 13:17:06,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {23962#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23963#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 13:17:06,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {23963#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23964#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 13:17:06,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {23964#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23965#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 13:17:06,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {23965#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23966#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 13:17:06,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {23966#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23967#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 13:17:06,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {23967#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23968#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-15 13:17:06,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {23968#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23969#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-15 13:17:06,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {23969#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23970#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-15 13:17:06,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {23970#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23971#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 13:17:06,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {23971#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23972#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 13:17:06,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {23972#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23973#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 13:17:06,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {23973#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23974#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 13:17:06,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {23974#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23975#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-15 13:17:06,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {23975#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23976#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-15 13:17:06,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {23976#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23977#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-15 13:17:06,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {23977#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23978#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-15 13:17:06,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {23978#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23979#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-15 13:17:06,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {23979#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23980#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-15 13:17:06,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {23980#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23981#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-15 13:17:06,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {23981#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23982#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-15 13:17:06,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {23982#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23983#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-15 13:17:06,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {23983#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23984#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-15 13:17:07,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {23984#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23985#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-15 13:17:07,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {23985#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23986#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-15 13:17:07,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {23986#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23987#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-15 13:17:07,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {23987#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23988#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-15 13:17:07,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {23988#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23989#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-15 13:17:07,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {23989#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23990#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-15 13:17:07,049 INFO L290 TraceCheckUtils]: 38: Hoare triple {23990#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23991#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-15 13:17:07,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {23991#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23992#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-15 13:17:07,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {23992#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23993#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-15 13:17:07,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {23993#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23994#(and (<= main_~z~0 34) (<= 34 main_~z~0))} is VALID [2022-04-15 13:17:07,081 INFO L290 TraceCheckUtils]: 42: Hoare triple {23994#(and (<= main_~z~0 34) (<= 34 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23995#(and (<= main_~z~0 35) (<= 35 main_~z~0))} is VALID [2022-04-15 13:17:07,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {23995#(and (<= main_~z~0 35) (<= 35 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23996#(and (<= 36 main_~z~0) (<= main_~z~0 36))} is VALID [2022-04-15 13:17:07,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {23996#(and (<= 36 main_~z~0) (<= main_~z~0 36))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23997#(and (<= 37 main_~z~0) (<= main_~z~0 37))} is VALID [2022-04-15 13:17:07,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {23997#(and (<= 37 main_~z~0) (<= main_~z~0 37))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {23998#(and (<= main_~z~0 38) (<= 38 main_~z~0))} is VALID [2022-04-15 13:17:07,123 INFO L290 TraceCheckUtils]: 46: Hoare triple {23998#(and (<= main_~z~0 38) (<= 38 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {24142#(and (<= main_~z~0 39) (<= 39 main_~z~0))} is VALID [2022-04-15 13:17:07,126 INFO L290 TraceCheckUtils]: 47: Hoare triple {24142#(and (<= main_~z~0 39) (<= 39 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {23956#false} is VALID [2022-04-15 13:17:07,126 INFO L272 TraceCheckUtils]: 48: Hoare triple {23956#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {23956#false} is VALID [2022-04-15 13:17:07,126 INFO L290 TraceCheckUtils]: 49: Hoare triple {23956#false} ~cond := #in~cond; {23956#false} is VALID [2022-04-15 13:17:07,126 INFO L290 TraceCheckUtils]: 50: Hoare triple {23956#false} assume 0 == ~cond; {23956#false} is VALID [2022-04-15 13:17:07,126 INFO L290 TraceCheckUtils]: 51: Hoare triple {23956#false} assume !false; {23956#false} is VALID [2022-04-15 13:17:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:07,126 INFO L328 TraceCheckSpWp]: Computing backward predicates...